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

DOI10.1016/S0168-0072(96)00009-7zbMATH Open0874.03056MaRDI QIDQ5961497FDOQ5961497

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)

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

zbMATH Keywords

enumeration degreeanticupping propertynoncuppable degree

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (26)

• Title not available (Why is that?)
• Complements for enumeration \(\Pi_1^0\)-degrees
• Title not available (Why is that?)
• Cupping $\Delta_2^0$ Enumeration Degrees to 0 e ′
• Badness and jump inversion in the enumeration degrees
• A join theorem for the computably enumerable degrees
• \(\Delta\)\( ^ 0_ 2\) degrees and transfer theorems
• 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
• Degrees with almost universal cupping property
• Finite cupping sets
• 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
• Title not available (Why is that?)
• 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)