Cupping and noncupping in the enumeration degrees of _ 2^ 0 sets

DOI10.1016/S0168-0072(96)00009-7MaRDI QIDQ5961497zbMATH OpenFDO

Authors S. Barry Cooper, Andrea Sorbi, Xiaoding Yi

Publication date 5 November 1997

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

enumeration degreeanticupping propertynoncuppable degree

Mathematics Subject Classification ID

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

Recommendations

• A high noncuppable \({\Sigma^0_2}\) \(e\)-degree
• Cupping Δ₂⁰ enumeration degrees to 0_e′
• Cupping $\Delta_2^0$ Enumeration Degrees to 0 e ′
• Cupping Classes of $\Sigma^0_2$ Enumeration Degrees

Cites work

• scientific article; zbMATH DE number 4160710 (Why is no real title available?)
• scientific article; zbMATH DE number 3784863 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Classical recursion theory. Vol. II
• Degrees joining to 0′
• Embedding the diamond in the Σ₂ enumeration degrees
• Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
• Enumeration reducibility and partial degrees
• Jumps of quasi-minimal enumeration degrees
• Noncappable enumeration degrees below 0_e^′
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Properly Σ2 Enumeration Degrees
• Recursively enumerable sets and degrees
• Reducibility and Completeness for Sets of Integers
• Semirecursive Sets and Positive Reducibility
• The upper semilattice of degrees ≤ 0′ is complemented

Cited in

(26)

• Complements for enumeration \(\Pi_1^0\)-degrees
• scientific article; zbMATH DE number 1421082 (Why is no real title available?)
• scientific article; zbMATH DE number 1048046 (Why is no real title available?)
• Badness and jump inversion in the enumeration degrees
• Cupping $\Delta_2^0$ Enumeration Degrees to 0 e ′
• \(\Delta\)\( ^ 0_ 2\) degrees and transfer theorems
• A join theorem for the computably enumerable degrees
• Theory and Applications of Models of Computation
• How enumeration reductibility yields extended Harrington non-splitting
• Cupping Δ₂⁰ enumeration degrees to 0_e′
• An extension of Harrington's noncupping theorem
• Cuppability of simple and hypersimple sets
• Finite cupping sets
• Degrees with almost universal cupping property
• Enumeration 1-genericity in the local enumeration degrees
• The limitations of cupping in the local structure of the enumeration degrees
• Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees
• The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees
• Definability in the local theory of the \(\omega \)-enumeration degrees
• On the jump classes of noncuppable enumeration degrees
• Cupping Classes of $\Sigma^0_2$ Enumeration Degrees
• IN MEMORIAM: BARRY COOPER 1943–2015
• scientific article; zbMATH DE number 5354059 (Why is no real title available?)
• A high noncuppable \({\Sigma^0_2}\) \(e\)-degree
• Cupping and definability in the local structure of the enumeration degrees
• Strong noncuppability in low computably enumerable degrees

This page was built for publication: Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets

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