Infinite family of _a^-1-sets with a unique computable numbering

DOI10.1007/S10958-012-1141-4MaRDI QIDQ1948665zbMATH 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-1141-4

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Cites work

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

Cited in

(6)

• On universal pairs in the Ershov hierarchy
• Rogers semilattices for families of equivalence relations in the Ershov hierarchy
• Reductions between types of numberings
• An infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering
• scientific article; zbMATH DE number 7139148 (Why is no real title available?)
• Effectively infinite classes of numberings of computable families of reals

This page was built for publication: Infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering

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