Khutoretskii’s Theorem for Generalized Computable Families

Abstract

© 2019, Springer Science+Business Media, LLC, part of Springer Nature. We give sufficient conditions for generalized computable numberings to satisfy the statement of Khutoretskii’s theorem. This implies limitedness of universal Σα0− computable numberings for 2 ≤α<ω1CK.