|
This article is cited in 1 scientific paper (total in 1 paper)
Negative numberings in admissible sets. I
I. Sh. Kalimullinab, V. G. Puzarenkocd, M. Kh. Faizrahmanovab a Kazan Federal University, Kazan, 420008, Russia
b Scientific-Educational Mathematical Center of Volga Federal District
c Sobolev Institute of Mathematics, Novosibirsk, 630090, Russia
d Novosibirsk State University, Novosibirsk, 630090, Russia
Abstract:
We construct an admissible set $\mathbb{A}$ such that the family of all $\mathbb{A}$-computably enumerable sets possesses a negative computable $\mathbb{A}$-numbering but lacks positive computable $\mathbb{A}$-numberings. We also discuss the question on existence of minimal negative $\mathbb{A}$-numberings.
Key words:
numbering, decidable numbering, positive numbering, negative numbering, computable numbering, computable set, computably enumerable set,
admissible set.
Received: 25.05.2023 Revised: 14.06.2023 Accepted: 16.06.2023
Citation:
I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrahmanov, “Negative numberings in admissible sets. I”, Mat. Tr., 26:1 (2023), 47–92; Siberian Adv. Math., 33:4 (2023), 293–321
Linking options:
https://www.mathnet.ru/eng/mt689 https://www.mathnet.ru/eng/mt/v26/i1/p47
|
|