Cupping Classes of $\Sigma^0_2$ Enumeration Degrees

DOI10.1007/978-3-540-69407-6_59zbMath1142.03356OpenAlexW2289300403MaRDI QIDQ3507472

Mariya Ivanova Soskova

Publication date: 19 June 2008

Published in: Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_59

Mathematics Subject Classification ID

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

Related Items (1)

The limitations of cupping in the local structure of the enumeration degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(n\)-rea enumeration degrees are dense
• Degrees joining to 0′
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Partial degrees and the density problem
• Cupping $\Delta_2^0$ Enumeration Degrees to 0 e ′
• Semirecursive Sets and Positive Reducibility
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets

This page was built for publication: Cupping Classes of $\Sigma^0_2$ Enumeration Degrees