Bounding nonsplitting enumeration degrees

DOI10.2178/JSL/1203350795MaRDI QIDQ5444709zbMATH OpenOpenAlexFDO

Authors Thomas F. Kent, Andrea Sorbi

Publication date 25 February 2008

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

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

zbMATH Keywords

enumeration degreenonsplitting

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• A non-splitting theorem in the enumeration degrees
• Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees
• Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees
• How enumeration reductibility yields extended Harrington non-splitting
• Initial segments of the \({\Sigma}_2^0\) enumeration degrees

Cites work

• On minimal pairs of enumeration degrees
• On the degrees less than 0'
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Some Special Pairs of Σ2 e-Degrees
• The \(n\)-rea enumeration degrees are dense

Cited in

(11)

• A non-splitting theorem in the enumeration degrees
• Enumeration 1-genericity in the local enumeration degrees
• The automorphism group and definability of the jump operator in the \(\omega\)-enumeration degrees
• Non-manipulable domains for the Borda count
• A note on the enumeration degrees of 1-generic sets
• Bounding minimal degrees by computably enumerable degrees
• scientific article; zbMATH DE number 7360060 (Why is no real title available?)
• Extensions of two constructions of Ahmad
• Genericity and Non-bounding in the Enumeration degrees
• Bounded enumeration reducibility and its degree structure
• Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective

This page was built for publication: Bounding nonsplitting enumeration degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5444709)