Simple Proofs of Some Theorems on High Degrees of Unsolvability

DOI10.4153/CJM-1977-105-5zbMath0355.02032MaRDI QIDQ4126330

Carl G. jun. Jockusch

Publication date: 1977

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

There is no ordering on the classes in the generalized high/low hierarchies ⋮ Bounding minimal degrees by computably enumerable degrees ⋮ Higher randomness and forcing with closed sets ⋮ Upper bounds for the arithmetical degrees ⋮ The Typical Constructible Object ⋮ 2-minimality, jump classes and a note on natural definability ⋮ Randomness, lowness and degrees ⋮ Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees ⋮ Automorphism bases for degrees of unsolvability ⋮ Joining up to the generalized high degrees ⋮ A high c.e. degree which is not the join of two minimal degrees ⋮ Decidability and Invariant Classes for Degree Structures ⋮ Unnamed Item ⋮ Degrees joining to 0′ ⋮ The upper semilattice of degrees ≤ 0′ is complemented ⋮ Degrees which do not bound minimal degrees