Goodness in the enumeration and singleton degrees
From MaRDI portal
Publication:992037
DOI10.1007/s00153-010-0192-9zbMath1202.03051OpenAlexW2018499782MaRDI QIDQ992037
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
Related Items
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
