电邮这篇文章 Index Set of Linear Orderings that are Autostable Relative to Strong Constructivizations
- 作者: Goncharov S.S.1,2, Bazhenov N.A.1,2, Marchuk M.I.1
-
隶属关系:
- Sobolev Institute of Mathematics SB RAS
- Novosibirsk State University
- 期: 卷 221, 编号 6 (2017)
- 页面: 840-848
- 栏目: Article
- URL: https://ogarev-online.ru/1072-3374/article/view/239118
- DOI: https://doi.org/10.1007/s10958-017-3272-0
- ID: 239118
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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.
作者简介
S. Goncharov
Sobolev Institute of Mathematics SB RAS; Novosibirsk State University
编辑信件的主要联系方式.
Email: s.s.goncharov@math.nsc.ru
俄罗斯联邦, 4, pr. Akad. Koptyuga, Novosibirsk, 630090; 2, ul. Pirogova, Novosibirsk, 630090
N. Bazhenov
Sobolev Institute of Mathematics SB RAS; Novosibirsk State University
Email: s.s.goncharov@math.nsc.ru
俄罗斯联邦, 4, pr. Akad. Koptyuga, Novosibirsk, 630090; 2, ul. Pirogova, Novosibirsk, 630090
M. Marchuk
Sobolev Institute of Mathematics SB RAS
Email: s.s.goncharov@math.nsc.ru
俄罗斯联邦, 4, pr. Akad. Koptyuga, Novosibirsk, 630090
补充文件
