|
Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Informatika, 2015, Volume 15, Issue 1, Pages 54–62
(Mi vngu362)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Computable families of sets in Ershov hierarchy without principal numberings
S. S. Ospichev Novosibirsk State University
Abstract:
There was constructed example of computable family of sets without $\Sigma^{-1}_{a}$-principal numberings, for any $a\in\mathcal{O}$.
Keywords:
computable numbering, Ershov hierarchy.
Received: 28.01.2013
Citation:
S. S. Ospichev, “Computable families of sets in Ershov hierarchy without principal numberings”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 15:1 (2015), 54–62; J. Math. Sci., 215:4 (2016), 529–536
Linking options:
https://www.mathnet.ru/eng/vngu362 https://www.mathnet.ru/eng/vngu/v15/i1/p54
|
Statistics & downloads: |
Abstract page: | 221 | Full-text PDF : | 69 | References: | 46 | First page: | 9 |
|