The degrees below a 1-generic degree < 0′

DOI10.2307/2274030zbMath0633.03039MaRDI 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 cover; 1-generic degree; nonrecursive predecessor

Mathematics Subject Classification ID

03D30: Other degrees and reducibilities in computability and recursion theory

Related Items

A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE, A note on the enumeration degrees of 1-generic sets, Natural factors of the Muchnik lattice capturing IPC, Embedding and coding below a 1-generic degree, Generic degrees are complemented, Dynamic notions of genericity and array noncomputability, On low for speed oracles, Arithmetical Sacks forcing, 1-generic splittings of computably enumerable degrees, 1-Generic Degrees Bounding Minimal Degrees Revisited

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