On Σ1-Structural Differences Among Finite Levels of the Ershov Hierarchy

DOI10.2178/JSL/1164060453zbMath1112.03038OpenAlexW2023442731MaRDI QIDQ3416112

Liang Yu, Yue Yang

Publication date: 19 January 2007

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

Full work available at URL: https://doi.org/10.2178/jsl/1164060453

zbMATH Keywords

Ershov hierarchyc.e. degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (8)

THE n-r.e. DEGREES: UNDECIDABILITY AND Σ₁ SUBSTRUCTURES ⋮ Isolation from side and cone avoidance in the 2-computably enumerable \textit{wtt}-degrees ⋮ Isolated maximal d.r.e. degrees ⋮ Isolation from side in 2-computably enumerable degrees ⋮ Weak density and nondensity among transfinite levels of the Ershov hierarchy ⋮ A survey of results on the d.c.e. and \(n\)-c.e. degrees ⋮ Turing computability: structural theory ⋮ Model-theoretic properties of Turing degrees in the Ershov difference hierarchy

Cites Work

• The d.r.e. degrees are not dense
• The recursively enumerable degrees are dense
• A minimal degree less than 0’

This page was built for publication: On Σ₁-Structural Differences Among Finite Levels of the Ershov Hierarchy