|
This article is cited in 3 scientific papers (total in 3 papers)
Positive numberings in admissible sets
I. Sh. Kalimullina, V. G. Puzarenkobc, M. Kh. Faizrahmanova a Kazan (Volga Region) Federal University
b Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
c Novosibirsk State University
Abstract:
We construct the example of an admissible set ${\Bbb A}$ such that there exists a positive computable ${\Bbb A}$-numbering of the family of all ${\Bbb A}$-c.e. sets, whereas any negative computable ${\Bbb A}$-numberings are absent.
Keywords:
numbering, decidable numbering, positive numbering, negative numbering, computable numbering, computable set, computably enumerable set, admissible set.
Received: 24.02.2020 Revised: 24.02.2020 Accepted: 08.04.2020
Citation:
I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrahmanov, “Positive numberings in admissible sets”, Sibirsk. Mat. Zh., 61:3 (2020), 607–621; Siberian Math. J., 61:3 (2020), 478–489
Linking options:
https://www.mathnet.ru/eng/smj6004 https://www.mathnet.ru/eng/smj/v61/i3/p607
|
Statistics & downloads: |
Abstract page: | 223 | Full-text PDF : | 79 | References: | 27 | First page: | 3 |
|