Avoiding uniformity in the _2⁰ enumeration degrees

DOI10.1016/J.APAL.2014.04.008zbMATH Open1351.03030OpenAlexW2047884664MaRDI QIDQ2453064FDOQ2453064

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

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 \(\Delta_2^0\) e-degrees
• scientific article; zbMATH DE number 28544

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Computable structures and the hyperarithmetical hierarchy
• Title not available (Why is that?)
• Title not available (Why is that?)
• Semirecursive Sets and Positive Reducibility
• Title not available (Why is that?)
• Classical recursion theory. Vol. II
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• The \(n\)-rea enumeration degrees are dense
• Limit lemmas and jump inversion in the enumeration degrees
• Reducibility and Completeness for Sets of Integers
• Title not available (Why is that?)
• On minimal pairs of enumeration degrees
• Goodness in the enumeration and singleton degrees
• Title not available (Why is that?)
• Degrees in Which the Recursive Sets are Uniformly Recursive
• Turing degrees and the Ershov hierarchy
• The Ershov hierarchy
• Title not available (Why is that?)
• Properly Σ2 Enumeration Degrees
• The limitations of cupping in the local structure of the enumeration degrees
• Cuppings and cappings in enumeration \(\Delta_2^0\) degrees
• Title not available (Why is that?)

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)