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

MaRDI QIDQ2899010zbMATH OpenFDO

Authors S. S. Ospichev

Publication date 13 July 2012

Published in Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika (Search for Journal in Brave)

zbMATH Keywords

Ershov hierarchycomputable numbering

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55)

Recommendations

• Infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering
• Computable numberings of families of infinite sets
• scientific article; zbMATH DE number 4101161
• Effectively infinite classes of numberings of computable families of reals
• scientific article; zbMATH DE number 2167508
• Almost computably enumerable families of sets
• The number of nonequivalent computable indexations for a fixed family of sets
• scientific article; zbMATH DE number 7139148
• Some absolute properties of \(A\)-computable numberings
• On the existence of universal numberings for finite families of d.c.e. sets

Cited in

(6)

• The branching theorem and computable categoricity in the Ershov hierarchy
• Effectively infinite classes of numberings of computable families of reals
• scientific article; zbMATH DE number 1923100 (Why is no real title available?)
• Friedberg numberings in the Ershov hierarchy
• scientific article; zbMATH DE number 7139148 (Why is no real title available?)
• Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings

This page was built for publication: An 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 Q2899010)