Badness and jump inversion in the enumeration degrees

DOI10.1007/s00153-012-0268-9zbMath1247.03079OpenAlexW2088806734MaRDI QIDQ412060

Charles M. Harris

Publication date: 3 May 2012

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

Full work available at URL: https://doi.org/10.1007/s00153-012-0268-9

zbMATH Keywords

approximationsenumeration degreeshigh/low hierarchyjump inversion

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Goodness in the enumeration and singleton degrees
• Classical recursion theory. The theory of functions and sets of natural numbers
• The \(n\)-rea enumeration degrees are dense
• Limit lemmas and jump inversion in the enumeration degrees
• Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees
• On the jump classes of noncuppable enumeration degrees
• The Π₂⁰ enumeration degrees are not dense
• Reducibility and Completeness for Sets of Integers
• On minimal pairs of enumeration degrees
• Semirecursive Sets and Positive Reducibility
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets