AbstractWe show that the elementary theory of the recursively enumerable tt-degrees has the same computational complexity as true first-order arithmetic. As auxiliary results, we prove theorems about exact pairs and initial segments in the tt-degrees
We prove that the first-order theory of the Medvedev degrees, the first-order theory of the Muchnik ...
We give a decision procedure for the ∀∃-theory of the weak truth-table (wtt) degrees of the recursiv...
In this manuscript we explore two topics in recursion theory and their interaction.The first topic i...
AbstractWe show that the elementary theory of the recursively enumerable tt-degrees has the same com...
We discuss the structure of the recursively enumerable sets under three reducibilities: Turing, trut...
We discuss the structure of the recursively enumerable sets under three reducibilities: Turing, trut...
AbstractThere is an interpretation of first-order arithmetic in the theory of the PTIME degrees of t...
We prove that the first-order theory of the Medvedev degrees, the first-order theory of the Muchnik ...
We prove that the first-order theory of the Medvedev degrees, the first-order theory of the Muchnik ...
We show that the first order theories of the s-degrees, and of the Q-degrees, are computably isomorp...
We show that the first order theories of the s-degrees, and of the Q-degrees, are computably isomorp...
We show that the first order theories of the s-degrees, and of the Q-degrees, are computably isomorp...
We investigate the truth-table degrees of (co-)c.e.\ sets, in particular,sets of random strings. It ...
When attempting to generalize recursion theory to admissible ordinals, it may seem as if all classic...
. We give a decision procedure for the 89-theory of the weak truthtable (wtt) degrees of the recurs...
We prove that the first-order theory of the Medvedev degrees, the first-order theory of the Muchnik ...
We give a decision procedure for the ∀∃-theory of the weak truth-table (wtt) degrees of the recursiv...
In this manuscript we explore two topics in recursion theory and their interaction.The first topic i...
AbstractWe show that the elementary theory of the recursively enumerable tt-degrees has the same com...
We discuss the structure of the recursively enumerable sets under three reducibilities: Turing, trut...
We discuss the structure of the recursively enumerable sets under three reducibilities: Turing, trut...
AbstractThere is an interpretation of first-order arithmetic in the theory of the PTIME degrees of t...
We prove that the first-order theory of the Medvedev degrees, the first-order theory of the Muchnik ...
We prove that the first-order theory of the Medvedev degrees, the first-order theory of the Muchnik ...
We show that the first order theories of the s-degrees, and of the Q-degrees, are computably isomorp...
We show that the first order theories of the s-degrees, and of the Q-degrees, are computably isomorp...
We show that the first order theories of the s-degrees, and of the Q-degrees, are computably isomorp...
We investigate the truth-table degrees of (co-)c.e.\ sets, in particular,sets of random strings. It ...
When attempting to generalize recursion theory to admissible ordinals, it may seem as if all classic...
. We give a decision procedure for the 89-theory of the weak truthtable (wtt) degrees of the recurs...
We prove that the first-order theory of the Medvedev degrees, the first-order theory of the Muchnik ...
We give a decision procedure for the ∀∃-theory of the weak truth-table (wtt) degrees of the recursiv...
In this manuscript we explore two topics in recursion theory and their interaction.The first topic i...
DOI
Add to ORKG