The limitations of cupping in the local structure of the enumeration degrees
From MaRDI portal
Publication:2267755
DOI10.1007/s00153-009-0171-1zbMath1197.03046OpenAlexW2026779193MaRDI QIDQ2267755
Publication date: 2 March 2010
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-009-0171-1
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
Cites Work
- The \(n\)-rea enumeration degrees are dense
- Branching in the enumeration degrees of the \(\Sigma_2^0\) sets
- Finite cupping sets
- Cupping Classes of $\Sigma^0_2$ Enumeration Degrees
- Degrees joining to 0′
- Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
- Cupping $\Delta_2^0$ Enumeration Degrees to 0 e ′
- Semirecursive Sets and Positive Reducibility
- A Maximum Principle for Degenerate Elliptic Equations
- Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item