Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
From MaRDI portal
Publication:5961497
DOI10.1016/S0168-0072(96)00009-7zbMath0874.03056MaRDI QIDQ5961497
Andrea Sorbi, Xiaoding Yi, S. Barry Cooper
Publication date: 5 November 1997
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Related Items (13)
Enumeration 1-genericity in the local enumeration degrees ⋮ IN MEMORIAM: BARRY COOPER 1943–2015 ⋮ Badness and jump inversion in the enumeration degrees ⋮ Cupping Classes of $\Sigma^0_2$ Enumeration Degrees ⋮ Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees ⋮ Complements for enumeration \(\Pi_1^0\)-degrees ⋮ Cupping and definability in the local structure of the enumeration degrees ⋮ A high noncuppable \({\Sigma^0_2}\) \(e\)-degree ⋮ Definability in the Local Theory of the ω-Enumeration Degrees ⋮ The limitations of cupping in the local structure of the enumeration degrees ⋮ Cupping Δ20 enumeration degrees to 0e′ ⋮ On the jump classes of noncuppable enumeration degrees ⋮ The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classical recursion theory. Vol. II
- Noncappable enumeration degrees below 0e′
- Degrees joining to 0′
- The upper semilattice of degrees ≤ 0′ is complemented
- Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
- Jumps of quasi-minimal enumeration degrees
- Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
- Properly Σ2 Enumeration Degrees
- Reducibility and Completeness for Sets of Integers
- Embedding the diamond in the Σ2 enumeration degrees
- Recursively enumerable sets and degrees
- Semirecursive Sets and Positive Reducibility
- Enumeration reducibility and partial degrees
This page was built for publication: Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
