Weak density and nondensity among transfinite levels of the Ershov hierarchy

DOI10.1215/00294527-2020-0023zbMath1486.03071OpenAlexW3114679342MaRDI QIDQ1981983

Cheng Peng, Yong Liu

Publication date: 7 September 2021

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1215/00294527-2020-0023

zbMATH Keywords

densityErshov hierarchy\(n\)-r.e. degrees\((\omega+1)\)-r.e. degreesnondensity

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Related Items (1)

Normalizing notations in the Ershov hierarchy

Cites Work

• The d.r.e. degrees are not dense
• Isolated maximal d.r.e. degrees
• The recursively enumerable degrees are dense
• THE n-r.e. DEGREES: UNDECIDABILITY AND Σ₁ SUBSTRUCTURES
• A minimal degree less than 0’
• On Σ₁-Structural Differences Among Finite Levels of the Ershov Hierarchy
• Relative enumerability in the difference hierarchy
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weak density and nondensity among transfinite levels of the Ershov hierarchy