Branching in the enumeration degrees of the \(\Sigma_2^0\) sets

DOI10.1007/BF02808174zbMath0924.03080OpenAlexW2004547606MaRDI QIDQ1293973

André Nies, Andrea Sorbi

Publication date: 15 September 1999

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02808174

zbMATH Keywords

branching degreeenumeration degrees

Mathematics Subject Classification ID

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

Related Items

Embedding finite lattices into the Σ₂⁰ enumeration degrees ⋮ Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective ⋮ The limitations of cupping in the local structure of the enumeration degrees ⋮ Diamond embeddings into the enumeration degrees

Cites Work

• The density of infima in the recursively enumerable degrees
• The density of the nonbranching degrees
• Not every finite lattice is embeddable in the recursively enumerable degrees
• The \(n\)-rea enumeration degrees are dense
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Jumps of quasi-minimal enumeration degrees
• Reducibility and Completeness for Sets of Integers
• Embedding the diamond in the Σ₂ enumeration degrees
• On minimal pairs of enumeration degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item