Initial segments of the degrees of unsolvability
From MaRDI portal
Publication:2538529
DOI10.2307/1970779zbMath0193.31004OpenAlexW2319599413MaRDI QIDQ2538529
Publication date: 1971
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1970779
Other degrees and reducibilities in computability and recursion theory (03D30) Turing machines and related notions (03D10)
Related Items
The structure of the honest polynomial m-degrees ⋮ Lattices of c-degrees ⋮ The ∀∃-theory of ℛ(≤,∨,∧) is undecidable ⋮ Turing incomparability in Scott sets ⋮ Initial segments of the degrees of constructibility ⋮ A non-inversion theorem for the jump operator ⋮ The jump is definable in the structure of the degrees of unsolvability ⋮ Not every finite lattice is embeddable in the recursively enumerable degrees ⋮ Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes ⋮ DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP ⋮ Automorphism bases for degrees of unsolvability ⋮ The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory ⋮ On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making ⋮ Banach–Mazur games, comeager sets and degrees of unsolvability ⋮ Countable thin \(\Pi^0_1\) classes ⋮ An application of Σ40 determinacy to the degrees of unsolvability ⋮ Fragments of the theory of the enumeration degrees ⋮ Lattice initial segments of the hyperdegrees ⋮ On finite lattices of degrees of constructibility ⋮ Undecidability and initial segments of the (r.e.) tt-degrees ⋮ Decidability and Invariant Classes for Degree Structures ⋮ Minimal degrees recursive in 1-generic degrees ⋮ Initial segments of the degrees of size \(\aleph _ 1\) ⋮ Tracing and domination in the Turing degrees ⋮ Degree Structures: Local and Global Investigations ⋮ Lattice representations for computability theory ⋮ Independence Results on the Global Structure of the Turing Degrees
