Properties of numberings in various levels of the Ershov hierarchy

DOI10.1007/S10958-012-1140-5MaRDI QIDQ1948664zbMATH OpenOpenAlexFDO

Authors S. S. Ospichev

Publication date 24 April 2013

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-012-1140-5

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Recommendations

• Some properties of the numberings of various classes in the Ershov hierarchy
• Friedberg numberings in the Ershov hierarchy
• Friedberg numberings in the Ershov hierarchy
• Computable numberings in the hierarchy of Ershov
• Relative enumerability in Ershov's hierarchy
• scientific article; zbMATH DE number 2047498
• Mathematical Foundations of Computer Science 2003
• The Ershov hierarchy
• Ershov hierarchy

Cites work

• scientific article; zbMATH DE number 2167508 (Why is no real title available?)
• Generalized computable numerations and nontrivial Rogers semilattices
• On a hierarchy of sets. III

Cited in

(11)

• \(\varepsilon\)-principal numberings
• Some properties of the numberings of various classes in the Ershov hierarchy
• Rogers semilattices of families of two embedded sets in the Ershov hierarchy
• Friedberg numberings in the Ershov hierarchy
• Computable numberings of families of infinite sets
• Theory and Applications of Models of Computation
• Positive undecidable numberings in the Ershov hierarchy
• Rogers semilattices for families of equivalence relations in the Ershov hierarchy
• Index sets and universal numberings
• Computable numberings in the hierarchy of Ershov
• Partial decidable presentations in hyperarithmetic

This page was built for publication: Properties of numberings in various levels of the Ershov hierarchy

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