Normalizing notations in the Ershov hierarchy

DOI10.1002/MALQ.202100004zbMath1521.03120OpenAlexW3216020637MaRDI QIDQ6094127

Cheng Peng

Publication date: 12 September 2023

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

Full work available at URL: https://doi.org/10.1002/malq.202100004

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Hierarchies of computability and definability (03D55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof theory. 2nd ed
• The d.r.e. degrees are not dense
• Weak density and nondensity among transfinite levels of the Ershov hierarchy
• The recursively enumerable degrees are dense
• A minimal degree less than 0’
• Relative enumerability in the difference hierarchy
• A cornucopia of minimal degrees

This page was built for publication: Normalizing notations in the Ershov hierarchy