电邮这篇文章 Khutoretskii’s Theorem for Generalized Computable Families
- 作者: Faizrakhmanov M.K.1
-
隶属关系:
- Kazan (Volga Region) Federal University
- 期: 卷 58, 编号 4 (2019)
- 页面: 356-365
- 栏目: Article
- URL: https://journal-vniispk.ru/0002-5232/article/view/234152
- DOI: https://doi.org/10.1007/s10469-019-09557-9
- ID: 234152
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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}. \)
作者简介
M. Faizrakhmanov
Kazan (Volga Region) Federal University
编辑信件的主要联系方式.
Email: marat.faizrahmanov@gmail.com
俄罗斯联邦, ul. Kremlevskaya 18, Kazan, 420008
补充文件
