Simple Proofs of Some Theorems on High Degrees of Unsolvability

DOI10.4153/CJM-1977-105-5zbMATH Open0355.02032MaRDI QIDQ4126330FDOQ4126330

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)

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

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)