Bounding nonsplitting enumeration degrees

DOI10.2178/jsl/1203350795zbMath1131.03019OpenAlexW2057205169MaRDI QIDQ5444709

Andrea Sorbi, Thomas F. Kent

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)

Related Items (5)

A note on the enumeration degrees of 1-generic sets ⋮ Enumeration 1-genericity in the local enumeration degrees ⋮ Unnamed Item ⋮ Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective ⋮ The automorphism group and definability of the jump operator in the \(\omega\)-enumeration degrees

Cites Work

• The \(n\)-rea enumeration degrees are dense
• 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
• On minimal pairs of enumeration degrees

This page was built for publication: Bounding nonsplitting enumeration degrees