There exists a maximal 3-c.e. enumeration degree

DOI10.1007/BF02785966zbMath1118.03032MaRDI QIDQ2382237

Andrea Sorbi, Ang Sheng Li, S. Barry Cooper, Yue Yang

Publication date: 28 September 2007

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On degrees of recursive unsolvability
• Computing degrees of unsolvability
• The d.r.e. degrees are not dense
• The \(n\)-rea enumeration degrees are dense
• Density results in the \(\Delta_2^0\) e-degrees
• The recursively enumerable degrees are dense
• The Π₂⁰ enumeration degrees are not dense
• Splitting properties of n-c.e. enumeration degrees
• Note on Degrees of Partial Functions
• A minimal degree less than 0’
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Reducibility and Completeness for Sets of Integers
• On minimal pairs of enumeration degrees
• Partial degrees and the density problem
• Trial and error predicates and the solution to a problem of Mostowski

This page was built for publication: There exists a maximal 3-c.e. enumeration degree