Avoiding uniformity in the _2⁰ enumeration degrees

DOI10.1016/J.APAL.2014.04.008MaRDI QIDQ2453064zbMATH OpenOpenAlexFDO

Authors Liliana Badillo, Charles M. Harris

Publication date 6 June 2014

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apal.2014.04.008

zbMATH Keywords

degreeErshov hierarchyenumeration reducibilitycappablearithmetical uniformityhighincomparable degreelow

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55) Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Properly Σ2 Enumeration Degrees
• Properly enumeration degrees and the high/low hierarchy
• Cupping $\Delta_2^0$ Enumeration Degrees to 0 e ′
• Density results in the _2⁰ e-degrees
• scientific article; zbMATH DE number 28544

Cites work

• scientific article; zbMATH DE number 4160710 (Why is no real title available?)
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1048046 (Why is no real title available?)
• scientific article; zbMATH DE number 1955470 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3323847 (Why is no real title available?)
• scientific article; zbMATH DE number 3342830 (Why is no real title available?)
• scientific article; zbMATH DE number 3342831 (Why is no real title available?)
• Classical recursion theory. Vol. II
• Computable structures and the hyperarithmetical hierarchy
• Cuppings and cappings in enumeration \(\Delta_2^0\) degrees
• Degrees in Which the Recursive Sets are Uniformly Recursive
• Goodness in the enumeration and singleton degrees
• Limit lemmas and jump inversion in the enumeration degrees
• On minimal pairs of enumeration degrees
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• Properly Σ2 Enumeration Degrees
• Reducibility and Completeness for Sets of Integers
• Semirecursive Sets and Positive Reducibility
• The Ershov hierarchy
• The \(n\)-rea enumeration degrees are dense
• The limitations of cupping in the local structure of the enumeration degrees
• Turing degrees and the Ershov hierarchy

Cited in

(5)

• Cupping $\Delta_2^0$ Enumeration Degrees to 0 e ′
• Every \({\Delta}^0_2\)-set is natural, up to Turing equivalence
• A uniform version of non-\(\mathrm{low}_{2}\)-ness
• Initial segments of the \({\Sigma}_2^0\) enumeration degrees
• Automorphisms of \(\eta\)-like computable linear orderings and Kierstead's conjecture

This page was built for publication: Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453064)