Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective

DOI10.1007/s00153-008-0081-7zbMath1149.03033OpenAlexW1998493502MaRDI QIDQ938234

Thomas F. Kent, Andrea Sorbi, Maria Libera Affatato

Publication date: 18 August 2008

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-008-0081-7

zbMATH Keywords

semirecursive setenumeration reducibilitybranching element

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The density of the nonbranching degrees
• The \(n\)-rea enumeration degrees are dense
• Branching in the enumeration degrees of the \(\Sigma_2^0\) sets
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Embedding the diamond in the Σ₂ enumeration degrees
• Some Special Pairs of Σ2 e-Degrees
• Bounding nonsplitting enumeration degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Semirecursive Sets and Positive Reducibility

This page was built for publication: Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective