The Theory of the Degrees below 0 ′
From MaRDI portal
Publication:3922661
DOI10.1112/jlms/s2-24.1.1zbMath0469.03027OpenAlexW2086881654MaRDI QIDQ3922661
Publication date: 1981
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-24.1.1
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
The ∀∃-theory of ℛ(≤,∨,∧) is undecidable ⋮ Interpreting true arithmetic in the theory of the r.e. truth table degrees ⋮ The last question on recursively enumerable \(m\)-degrees ⋮ Coding in the partial order of enumerable sets ⋮ The theory of ceers computes true arithmetic ⋮ Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes ⋮ The $\Delta ^0_2$ Turing degrees: Automorphisms and Definability ⋮ The relationship between local and global structure in the enumeration degrees ⋮ A Rigid Cone in the Truth-Table Degrees with Jump ⋮ The \(\omega\)-Turing degrees ⋮ Domination, forcing, array nonrecursiveness and relative recursive enumerability ⋮ Embedding and coding below a 1-generic degree ⋮ Differences between resource bounded degree structures ⋮ Fragments of the theory of the enumeration degrees ⋮ Decidability and Invariant Classes for Degree Structures ⋮ On the theory of the PTIME degrees of the recursive sets ⋮ Extensions of embeddings below computably enumerable degrees ⋮ Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees ⋮ Biinterpretability up to double jump in the degrees below $\mathbf {0}^{\prime }$
