Email this article Khutoretskii’s Theorem for Generalized Computable Families
- Authors: Faizrakhmanov M.K.1
-
Affiliations:
- Kazan (Volga Region) Federal University
- Issue: Vol 58, No 4 (2019)
- Pages: 356-365
- Section: Article
- URL: https://journals.rcsi.science/0002-5232/article/view/234152
- DOI: https://doi.org/10.1007/s10469-019-09557-9
- ID: 234152
Cite item
Open Access
Access granted
Subscription Access
Abstract
We give sufficient conditions for generalized computable numberings to satisfy the statement of Khutoretskii’s theorem. This implies limitedness of universal \( {\varSigma}_{\alpha}^0- \) computable numberings for 2 \( \le \alpha <{\omega}_1^{CK}. \)
About the authors
M. Kh. Faizrakhmanov
Kazan (Volga Region) Federal University
Author for correspondence.
Email: marat.faizrahmanov@gmail.com
Russian Federation, ul. Kremlevskaya 18, Kazan, 420008
Supplementary files
