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

zbMATH Open1249.03084MaRDI QIDQ2899010FDOQ2899010

Authors: S. S. Ospichev 

Publication date: 13 July 2012

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

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

zbMATH Keywords

Ershov hierarchycomputable numbering

Mathematics Subject Classification ID

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

Cited In (6)

• Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings
• Title not available (Why is that?)
• Friedberg numberings in the Ershov hierarchy
• The branching theorem and computable categoricity in the Ershov hierarchy
• Title not available (Why is that?)
• Effectively infinite classes of numberings of computable families of reals

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)