Cupping Classes of \Sigma^0_2 Enumeration Degrees

DOI10.1007/978-3-540-69407-6_59MaRDI QIDQ3507472zbMATH OpenOpenAlexFDO

Authors Mariya I. 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)

Recommendations

• The limitations of cupping in the local structure of the enumeration degrees
• Cupping \Delta₂⁰ Enumeration Degrees to 0 e ′
• Cupping Δ₂⁰ enumeration degrees to 0_e′
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
• Cupping and jump classes in the computably enumerable degrees

Cites work

• Cupping \Delta₂⁰ Enumeration Degrees to 0 e ′
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
• Degrees joining to 0′
• scientific article; zbMATH DE number 4160710 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1955470 (Why is no real title available?)
• Partial degrees and the density problem
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Semirecursive Sets and Positive Reducibility
• The \(n\)-rea enumeration degrees are dense

Cited in

(6)

• The limitations of cupping in the local structure of the enumeration degrees
• scientific article; zbMATH DE number 5354059 (Why is no real title available?)
• Cupping Δ₂⁰ enumeration degrees to 0_e′
• Cupping and definability in the local structure of the enumeration degrees
• Cupping \Delta₂⁰ Enumeration Degrees to 0 e ′
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507472)