THE n-r.e. DEGREES: UNDECIDABILITY AND Σ1 SUBSTRUCTURES

DOI10.1142/S0219061312500055zbMath1253.03068MaRDI QIDQ2909622

Mingzhong Cai, Richard A. Shore, Theodore A. Slaman

Publication date: 6 September 2012

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

Full work available at URL: https://doi.org/10.1142/s0219061312500055

zbMATH Keywords

undecidability; Turing degrees; \(\Sigma_1\)-substructure; \(n\)-computably enumerable; \(n\)-recursively enumerable

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

03D28: Other Turing degree structures

Related Items

Isolation from side and cone avoidance in the 2-computably enumerable \textit{wtt}-degrees, Isolated maximal d.r.e. degrees, Weak density and nondensity among transfinite levels of the Ershov hierarchy, Turing computability: structural theory, Isolation from side in 2-computably enumerable degrees, A survey of results on the d.c.e. and \(n\)-c.e. degrees

Cites Work

• Degrees of unsolvability: structure and theory
• The d.r.e. degrees are not dense
• First-order theory of the degrees of recursive unsolvability
• On a hierarchy of sets. III
• On degrees of unsolvability
• Degree Structures: Local and Global Investigations
• On Σ₁-Structural Differences Among Finite Levels of the Ershov Hierarchy
• DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
• On Downey's conjecture
• The undecidability of the recursively enumerable degrees
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• D.R.E. Degrees and the Nondiamond Theorem
• Interpretability and Definability in the Recursively Enumerable Degrees
• A minimal pair of recursively enumerable degrees
• Distributive Initial Segments of the Degrees of Unsolvability
• Limiting recursion