|
This article is cited in 3 scientific papers (total in 3 papers)
Partial decidable presentations in hyperarithmetic
I. Sh. Kalimullina, V. G. Puzarenkobc, M. Kh. Faizrahmanova a Kazan (Volga Region) Federal University, Kazan, Russia
b Sobolev Institute of Mathematics, Novosibirsk, Russia
c Novosibirsk State University, Novosibirsk, Russia
Abstract:
We study the problem of the existence of decidable and positive $\Pi_1^1$- and $\Sigma_1^1$-numberings of the families of $\Pi_1^1$- and $\Sigma_1^1$-cones with respect to inclusion. Some laws are found that reflect the presence of decidable computable $\Pi_1^1$- and $\Sigma_1^1$-numberings of these families in dependence on the analytical complexity of the set defining a cone.
Keywords:
numbering, decidable numbering, positive numbering, computable numbering, computable set, computably enumerable set, $e$-reducibility, hyperarithmetic set, constructible admissible set.
Received: 08.06.2018 Revised: 25.10.2018 Accepted: 19.11.2018
Citation:
I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrahmanov, “Partial decidable presentations in hyperarithmetic”, Sibirsk. Mat. Zh., 60:3 (2019), 599–609; Siberian Math. J., 60:3 (2019), 464–471
Linking options:
https://www.mathnet.ru/eng/smj3097 https://www.mathnet.ru/eng/smj/v60/i3/p599
|
Statistics & downloads: |
Abstract page: | 340 | Full-text PDF : | 84 | References: | 46 | First page: | 12 |
|