|
Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Informatika, 2010, Volume 10, Issue 4, Pages 125–132
(Mi vngu63)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
Some Properties of Numberings in Various Levels in Ershov's Hierarchy
S. S. Ospichev Novosibirsk State University
Abstract:
There was proved, that there no $\Delta^{-1}_{a}$-computable numbering of family of all $\Delta^{-1}_{a}$-sets, $a$ is constructive ordinal. Also there was proved, that there is minimal $\omega$-computable numbering of family of all sets from $\bigcup\limits_{k\in\omega}\Sigma_{k}^{-1}$.
Keywords:
computable numbering, friedberg numbering, Ershov's hierarchy.
Received: 22.01.2010
Citation:
S. S. Ospichev, “Some Properties of Numberings in Various Levels in Ershov's Hierarchy”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 10:4 (2010), 125–132; J. Math. Sci., 188:4 (2013), 441–448
Linking options:
https://www.mathnet.ru/eng/vngu63 https://www.mathnet.ru/eng/vngu/v10/i4/p125
|
Statistics & downloads: |
Abstract page: | 225 | Full-text PDF : | 85 | References: | 41 | First page: | 1 |
|