The degrees below a 1-generic degree < 0′

DOI10.2307/2274030MaRDI QIDQ3770518zbMATH OpenOpenAlexFDO

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

1-generic degreeminimal covernonrecursive predecessor

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(15)

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

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)