The degrees below a 1-generic degree < 0′

DOI10.2307/2274030zbMATH Open0633.03039OpenAlexW2126790594MaRDI QIDQ3770518FDOQ3770518

Authors: Christine Ann Haught 

Publication date: 1986

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274030

zbMATH Keywords

minimal cover1-generic degreenonrecursive predecessor

Mathematics Subject Classification ID

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

Cites Work

• The upper semi-lattice of degrees of recursive unsolvability
• Banach–Mazur games, comeager sets and degrees of unsolvability
• Initial segments of the degrees of unsolvability Part II: minimal degrees

Cited In (15)

• On low for speed oracles
• Generic degrees are complemented
• 1-generic splittings of computably enumerable degrees
• A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
• A note on the enumeration degrees of 1-generic sets
• On low for speed oracles
• Embedding and coding below a 1-generic degree
• 1-Generic Degrees Bounding Minimal Degrees Revisited
• Separating weak \(\alpha\)-change and \(\alpha\)-change genericity
• Arithmetical Sacks forcing
• Members of thin \(\Pi_1^0\) classes and generic degrees
• MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY
• Dynamic notions of genericity and array noncomputability
• Multiple genericity: a new transfinite hierarchy of genericity notions
• Natural factors of the Muchnik lattice capturing IPC

This page was built for publication: The degrees below a 1-generic degree < 0′

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