The degrees below a 1-generic degree < 0′

DOI10.2307/2274030zbMath0633.03039OpenAlexW2126790594MaRDI QIDQ3770518

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)

Related Items

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

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