|
This article is cited in 9 scientific papers (total in 9 papers)
Khutoretskii's theorem for generalized computable families
M. Kh. Faizrakhmanov Kazan (Volga Region) Federal University
Abstract:
We give sufficient conditions for generalized computable numberings
to satisfy the statement of Khutoretskii's
theorem. This implies limitedness of universal $\Sigma^0_\alpha$-computable
numberings for $2\leqslant\alpha<
\omega^{CK}_1$.
Keywords:
generalized computable family, generalized computable numbering,
Khutoretskii's theorem.
Received: 20.04.2018 Revised: 08.11.2019
Citation:
M. Kh. Faizrakhmanov, “Khutoretskii's theorem for generalized computable families”, Algebra Logika, 58:4 (2019), 528–541; Algebra and Logic, 58:4 (2019), 356–365
Linking options:
https://www.mathnet.ru/eng/al914 https://www.mathnet.ru/eng/al/v58/i4/p528
|
Statistics & downloads: |
Abstract page: | 284 | Full-text PDF : | 23 | References: | 29 | First page: | 6 |
|