The \(n\)-rea enumeration degrees are dense

DOI10.1007/BF01794984zbMath0848.03023MaRDI QIDQ1204114

Richard A. Shore, Alistair H. Lachlan

Publication date: 1 September 1993

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

zbMATH Keywords

densityapproximationsminimal coverenumeration degreese-degrees\(n\)-rea setsminimal e-degrees

Mathematics Subject Classification ID

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

Related Items

Enumeration 1-genericity in the local enumeration degrees ⋮ There exists a maximal 3-c.e. enumeration degree ⋮ Strong enumeration reducibilities ⋮ How enumeration reductibility yields extended Harrington non-splitting ⋮ Badness and jump inversion in the enumeration degrees ⋮ Cupping Classes of $\Sigma^0_2$ Enumeration Degrees ⋮ Density of the cototal enumeration degrees ⋮ Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees ⋮ Cupping and definability in the local structure of the enumeration degrees ⋮ Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective ⋮ Interpreting true arithmetic in the -enumeration degrees ⋮ The limitations of cupping in the local structure of the enumeration degrees ⋮ Bounding nonsplitting enumeration degrees ⋮ Goodness in the enumeration and singleton degrees ⋮ ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS ⋮ On cototality and the skip operator in the enumeration degrees ⋮ On the jump classes of noncuppable enumeration degrees ⋮ The structure of the s-degrees contained within a single e-degree ⋮ The jump operator on the \(\omega \)-enumeration degrees ⋮ A non-splitting theorem in the enumeration degrees ⋮ Quasi-minimal enumeration degrees and minimal Turing degrees ⋮ The Π₃-theory of the -enumeration degrees is undecidable ⋮ Branching in the enumeration degrees of the \(\Sigma_2^0\) sets ⋮ Definability via Kalimullin pairs in the structure of the enumeration degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on Degrees of Partial Functions
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Reducibility and Completeness for Sets of Integers
• Partial degrees and the density problem
• Semirecursive Sets and Positive Reducibility