Simple Proofs of Some Theorems on High Degrees of Unsolvability

DOI10.4153/CJM-1977-105-5MaRDI QIDQ4126330zbMATHFDO

Authors 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)

Cited in

(16)

• The upper semilattice of degrees ≤ 0′ is complemented
• Bounding minimal degrees by computably enumerable degrees
• Degrees joining to 0′
• Randomness, lowness and degrees
• There is no ordering on the classes in the generalized high/low hierarchies
• Degrees which do not bound minimal degrees
• Decidability and Invariant Classes for Degree Structures
• Higher randomness and forcing with closed sets
• Minimal weak truth table degrees and computably enumerable Turing degrees
• Upper bounds for the arithmetical degrees
• 2-minimality, jump classes and a note on natural definability
• A Galois connection between Turing jumps and limits
• Joining up to the generalized high degrees
• The typical constructible object
• Automorphism bases for degrees of unsolvability
• A high c.e. degree which is not the join of two minimal degrees

This page was built for publication: Simple Proofs of Some Theorems on High Degrees of Unsolvability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4126330)