Cupping and definability in the local structure of the enumeration degrees

DOI10.2178/JSL/1327068696zbMath1241.03051OpenAlexW2033752226MaRDI QIDQ5388723

Hristo Ganchev, Mariya Ivanova Soskova

Publication date: 19 April 2012

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1327068696

zbMATH Keywords

definabilitylocal structureenumeration degreecupping

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (6)

The automorphism group of the enumeration degrees ⋮ A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES ⋮ The enumeration degrees: Local and global structural interactions ⋮ On Kalimullin pairs ⋮ Defining totality in the enumeration degrees ⋮ Definability via Kalimullin pairs in the structure of the enumeration degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A non-splitting theorem in the enumeration degrees
• The \(n\)-rea enumeration degrees are dense
• Cupping Δ₂⁰ enumeration degrees to 0_e′
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Jumps of quasi-minimal enumeration degrees
• 1-genericity in the enumeration degrees
• Properly Σ2 Enumeration Degrees
• Reducibility and Completeness for Sets of Integers
• DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
• Interpreting true arithmetic in the local structure of the enumeration degrees
• The distribution of properly Σ₂⁰ e-degrees
• Semirecursive Sets and Positive Reducibility
• Bounding and nonbounding minimal pairs in the enumeration degrees
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets

This page was built for publication: Cupping and definability in the local structure of the enumeration degrees