Goodness in the enumeration and singleton degrees

DOI10.1007/S00153-010-0192-9zbMath1202.03051OpenAlexW2018499782MaRDI QIDQ992037

Charles M. Harris

Publication date: 8 September 2010

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

Full work available at URL: https://doi.org/10.1007/s00153-010-0192-9

zbMATH Keywords

enumeration reducibilitypartial order embeddingssingleton degrees

Mathematics Subject Classification ID

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

Related Items (7)

Enumeration 1-genericity in the local enumeration degrees ⋮ Badness and jump inversion in the enumeration degrees ⋮ Density of the cototal enumeration degrees ⋮ Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees ⋮ Bounded enumeration reducibility and its degree structure ⋮ On cototality and the skip operator in the enumeration degrees ⋮ On the jump classes of noncuppable enumeration degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong enumeration reducibilities
• e- and s-degrees
• Classical recursion theory. The theory of functions and sets of natural numbers
• The \(n\)-rea enumeration degrees are dense
• Limit lemmas and jump inversion in the enumeration degrees
• The upper semi-lattice of degrees of recursive unsolvability
• On the jump classes of noncuppable enumeration degrees
• s-Degrees within e-Degrees
• On minimal pairs of enumeration degrees
• Partial degrees and the density problem
• Degrees of Unsolvability. (AM-55)
• Semirecursive Sets and Positive Reducibility
• Enumeration reducibility and partial degrees

This page was built for publication: Goodness in the enumeration and singleton degrees