Minimal degrees recursive in 1-generic degrees

DOI10.1016/0168-0072(90)90020-3zbMath0714.03037OpenAlexW1971223443MaRDI QIDQ750429

Rodney G. Downey, Chi Tat Chong

Publication date: 1990

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(90)90020-3

zbMATH Keywords

minimal degree1-generic degree\(\Sigma _ 1\)-dense set of strings

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (13)

Separating weak \(\alpha\)-change and \(\alpha\)-change genericity ⋮ THE TURING DEGREES BELOW GENERICS AND RANDOMS ⋮ Members of thin Π₁⁰ classes and generic degrees ⋮ 1-Generic Degrees Bounding Minimal Degrees Revisited ⋮ The Information Content of Typical Reals ⋮ Generic degrees are complemented ⋮ Embedding and coding below a 1-generic degree ⋮ 1-generic degrees and minimal degrees in higher recursion theory. II ⋮ 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

• Unnamed Item
• Initial segments of the degrees of unsolvability
• ∑1-Density and Turing Degrees
• Degrees bounding minimal degrees
• Diagonalization in degree constructions

This page was built for publication: Minimal degrees recursive in 1-generic degrees