Email this article Partial Decidable Presentations in Hyperarithmetic
- Authors: Kalimullin I.S.1, Puzarenko V.G.2, Faizrahmanov M.K.1
-
Affiliations:
- Kazan (Volga Region) Federal University
- Sobolev Institute of Mathematics
- Issue: Vol 60, No 3 (2019)
- Pages: 464-471
- Section: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/172415
- DOI: https://doi.org/10.1134/S0037446619030091
- ID: 172415
Cite item
Open Access
Access granted
Subscription Access
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.
About the authors
I. Sh. Kalimullin
Kazan (Volga Region) Federal University
Author for correspondence.
Email: ikalimul@gmail.com
Russian Federation, Kazan
V. G. Puzarenko
Sobolev Institute of Mathematics
Author for correspondence.
Email: vagrig@math.nsc.ru
Russian Federation, Novosibirsk
M. Kh. Faizrahmanov
Kazan (Volga Region) Federal University
Author for correspondence.
Email: marat.faizrahmanov@gmail.com
Russian Federation, Kazan
