Standard

Partial Decidable Presentations in Hyperarithmetic. / Kalimullin, I. Sh; Puzarenko, V. G.; Faizrahmanov, M. Kh.

в: Siberian Mathematical Journal, Том 60, № 3, 01.05.2019, стр. 464-471.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Kalimullin, IS, Puzarenko, VG & Faizrahmanov, MK 2019, 'Partial Decidable Presentations in Hyperarithmetic', Siberian Mathematical Journal, Том. 60, № 3, стр. 464-471. https://doi.org/10.1134/S0037446619030091

APA

Kalimullin, I. S., Puzarenko, V. G., & Faizrahmanov, M. K. (2019). Partial Decidable Presentations in Hyperarithmetic. Siberian Mathematical Journal, 60(3), 464-471. https://doi.org/10.1134/S0037446619030091

Vancouver

Kalimullin IS, Puzarenko VG, Faizrahmanov MK. Partial Decidable Presentations in Hyperarithmetic. Siberian Mathematical Journal. 2019 май 1;60(3):464-471. doi: 10.1134/S0037446619030091

Author

Kalimullin, I. Sh ; Puzarenko, V. G. ; Faizrahmanov, M. Kh. / Partial Decidable Presentations in Hyperarithmetic. в: Siberian Mathematical Journal. 2019 ; Том 60, № 3. стр. 464-471.

BibTeX

@article{6cac792ab22f45858fce6f843653c129,
title = "Partial Decidable Presentations in Hyperarithmetic",
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.",
keywords = "computable numbering, computable set, computably enumerable set, constructible admissible set, decidable numbering, e-reducibility, hyperarithmetic set, numbering, positive numbering",
author = "Kalimullin, {I. Sh} and Puzarenko, {V. G.} and Faizrahmanov, {M. Kh}",
year = "2019",
month = may,
day = "1",
doi = "10.1134/S0037446619030091",
language = "English",
volume = "60",
pages = "464--471",
journal = "Siberian Mathematical Journal",
issn = "0037-4466",
publisher = "MAIK NAUKA/INTERPERIODICA/SPRINGER",
number = "3",

}

RIS

TY - JOUR

T1 - Partial Decidable Presentations in Hyperarithmetic

AU - Kalimullin, I. Sh

AU - Puzarenko, V. G.

AU - Faizrahmanov, M. Kh

PY - 2019/5/1

Y1 - 2019/5/1

N2 - 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.

AB - 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.

KW - computable numbering

KW - computable set

KW - computably enumerable set

KW - constructible admissible set

KW - decidable numbering

KW - e-reducibility

KW - hyperarithmetic set

KW - numbering

KW - positive numbering

UR - http://www.scopus.com/inward/record.url?scp=85067297474&partnerID=8YFLogxK

U2 - 10.1134/S0037446619030091

DO - 10.1134/S0037446619030091

M3 - Article

AN - SCOPUS:85067297474

VL - 60

SP - 464

EP - 471

JO - Siberian Mathematical Journal

JF - Siberian Mathematical Journal

SN - 0037-4466

IS - 3

ER -

ID: 20591033