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

DOI10.2178/JSL/1164060453MaRDI QIDQ3416112zbMATH OpenOpenAlexFDO

Authors Yue Yang, Liang Yu

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

c.e. degreeErshov hierarchy

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(9)

• 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
• The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures
• Theory and Applications of Models of Computation
• Isolation from side and cone avoidance in the 2-computably enumerable \textit{wtt}-degrees
• Model-theoretic properties of Turing degrees in the Ershov difference hierarchy

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

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