Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees

DOI10.1016/j.tcs.2010.12.042zbMath1251.03045OpenAlexW179285968MaRDI QIDQ2430010

S. Barry Cooper, Marat M. Arslanov, Mariya Ivanova Soskova, Iskander Sh. Kalimullin

Publication date: 5 April 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.042

zbMATH Keywords

splittingcomputabilityErshov hierarchyenumeration reducibilitynonsplitting

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)

Related Items

Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees, Badness and jump inversion in the enumeration degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A non-splitting theorem in the enumeration degrees
• How enumeration reductibility yields extended Harrington non-splitting
• Properly Σ2 Enumeration Degrees
• Reducibility and Completeness for Sets of Integers
• Embedding the diamond in the Σ₂ enumeration degrees
• Data Types as Lattices
• A recursively enumerable degree which will not split over all lesser ones
• Some Special Pairs of Σ2 e-Degrees
• On minimal pairs of enumeration degrees
• Structural properties and Σ₂⁰ enumeration degrees
• Arithmetical Reducibilities I
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets