Normalizing notations in the Ershov hierarchy

DOI10.1002/MALQ.202100004MaRDI QIDQ6094127zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On a generalization of normalizing extensions
• The computation of generalized Ehrhart series in normaliz
• Ershov hierarchy
• A note on the normalization of generating functions
• Normalizers of finite multiplicity nests
• The Ershov hierarchy
• Linearisations and the Ershov hierarchy
• Normalizers of nest algebras
• Generalization of normalizing extensions and some applications^∗
• A note on intermediate normalising extensions

Cites work

• A cornucopia of minimal degrees
• A minimal degree less than 0’
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3342830 (Why is no real title available?)
• scientific article; zbMATH DE number 3342831 (Why is no real title available?)
• Proceedings of the 10th Asian logic conference, Kobe, Japan, September 1--6, 2008
• Proof theory. 2nd ed
• Relative enumerability in the difference hierarchy
• The d.r.e. degrees are not dense
• The Ershov hierarchy
• The recursively enumerable degrees are dense
• Weak density and nondensity among transfinite levels of the Ershov hierarchy

Cited in

(3)

• Turing degrees in refinements of the arithmetical hierarchy
• Weak density and nondensity among transfinite levels of the Ershov hierarchy
• Normalization of Closed Ekedahl—Oort Strata

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

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