A non-splitting theorem in the enumeration degrees

DOI10.1016/j.apal.2009.01.009zbMath1183.03032OpenAlexW2132253471MaRDI QIDQ1032639

Mariya Ivanova Soskova

Publication date: 26 October 2009

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2009.01.009

zbMATH Keywords

e-degreesenumeration reducibilitynon-splitting\(\Sigma_2^0\) e-degrees

Mathematics Subject Classification ID

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

Related Items (4)

Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees ⋮ Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees ⋮ Cupping and definability in the local structure of the enumeration degrees ⋮ INITIAL SEGMENTS OF THE ENUMERATION DEGREES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(n\)-rea enumeration degrees are dense
• The recursively enumerable degrees are dense
• On the degrees less than 0'
• Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees
• How enumeration reductibility yields extended Harrington non-splitting
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• A recursively enumerable degree which will not split over all lesser ones

This page was built for publication: A non-splitting theorem in the enumeration degrees