|
|||||
|
|
Positive Numberings of Families of Sets in the Ershov Hierarchy |
|
| Authors: | Zh T Talasbaeva |
| Institution: | (1) Kazakhstan State University, Masanchi 39/47, Almaty, 480012, Kazakhstan |
| Abstract: | It is proved that there exist infinitely many positive undecidable 
n
-1
-computable numberings of every infinite family
that admits at least one
n
-1
-computable numbering and contains either the empty set, for even n, or N for odd n. |
| Keywords: | Ershov hierarchy positive undecidable |
| 本文献已被 SpringerLink 等数据库收录！ | |