Partial Decidable Presentations in Hyperarithmetic Full article
| Journal |
Siberian Mathematical Journal
ISSN: 0037-4466 , E-ISSN: 1573-9260 |
||||||
|---|---|---|---|---|---|---|---|
| Output data | Year: 2019, Volume: 60, Number: 3, Pages: 464-471 Pages count : 8 DOI: 10.1134/S0037446619030091 | ||||||
| Tags | computable numbering; computable set; computably enumerable set; constructible admissible set; decidable numbering; e-reducibility; hyperarithmetic set; numbering; positive numbering | ||||||
| Authors |
|
||||||
| Affiliations |
|
Abstract:
We study the problem of the existence of decidable and positive Π11- and Σ11-numberings of the families of Π11- and Σ11-cones with respect to inclusion. Some laws are found that reflect the presence of decidable computable Π11- and Σ11-numberings of these families in dependence on the analytical complexity of the set defining a cone. © 2019, Pleiades Publishing, Inc.
Cite:
Kalimullin I.S.
, Puzarenko V.G.
, Faizrahmanov M.K.
Partial Decidable Presentations in Hyperarithmetic
Siberian Mathematical Journal. 2019. V.60. N3. P.464-471. DOI: 10.1134/S0037446619030091 WOS Scopus OpenAlex
Partial Decidable Presentations in Hyperarithmetic
Siberian Mathematical Journal. 2019. V.60. N3. P.464-471. DOI: 10.1134/S0037446619030091 WOS Scopus OpenAlex
Original:
Калимуллин И.Ш.
, Пузаренко В.Г.
, Файзрахманов М.Х.
Частичные разрешимые представления в гиперарифметике
Сибирский математический журнал. 2019. Т.60. №3. С.599-609. DOI: 10.33048/smzh.2019.60.309 OpenAlex
Частичные разрешимые представления в гиперарифметике
Сибирский математический журнал. 2019. Т.60. №3. С.599-609. DOI: 10.33048/smzh.2019.60.309 OpenAlex
Identifiers:
| Web of science: | WOS:000471617300009 |
| Scopus: | 2-s2.0-85067297474 |
| OpenAlex: | W2952286598 |