Index Set of Linear Orderings that are Autostable Relative to Strong Constructivizations | Sciact - Система учета научной деятельности ИМ СО РАН

Index Set of Linear Orderings that are Autostable Relative to Strong Constructivizations Научная публикация

Журнал

Journal of Mathematical Sciences (United States)
ISSN: 1072-3374 , E-ISSN: 1573-8795

Вых. Данные

Год: 2017, Том: 221, Номер: 6, Страницы: 840-848 Страниц : 9 DOI: 10.1007/s10958-017-3272-0

Авторы

Goncharov S.S. ^1,2 , Bazhenov N.A. ^1,2 , Marchuk M.I. ¹

Организации

1	Sobolev Institute of Mathematics SB RAS, 4, pr. Akad. Koptyuga, Novosibirsk, 630090, Russian Federation
2	Novosibirsk State University, 2, ul. Pirogova, Novosibirsk, 630090, Russian Federation

We prove that a computable ordinal α is autostable relative to strong constructivizations if and only if α < ωω+1. We obtain an estimate of the algorithmic complexity for the class of strongly constructivizable linear orderings that are autostable relative to strong constructivizations. © 2017, Springer Science+Business Media New York.

Goncharov S.S. , Bazhenov N.A. , Marchuk M.I.
Index Set of Linear Orderings that are Autostable Relative to Strong Constructivizations
Journal of Mathematical Sciences (United States). 2017. V.221. N6. P.840-848. DOI: 10.1007/s10958-017-3272-0 Scopus OpenAlex

Scopus:	2-s2.0-85011635917
OpenAlex:	W2586908441

БД	Цитирований
Scopus	4
OpenAlex	5