Back to matchesWe found a matchYour institution may have access to this item. Find your institution then sign in to continue.TitleFamilies Without Minimal Numberings.AuthorsAbeshev, K.; Badaev, S.; Mustafa, M.AbstractIt is proved that for any nonzero computable ordinal and its arbitrary notation a, there exists a Σ-computable family without minimal computable numberings.SubjectsORDINAL numbers; NUMBER theory; COMPUTABLE functions; COMPUTABILITY logic; SET theoryPublicationAlgebra & Logic, 2014, Vol 53, Issue 4, p271ISSN0002-5232Publication typeArticleDOI10.1007/s10469-014-9290-9