THE INDEX SET OF THE GROUPS AUTOSTABLE RELATIVE TO STRONG CONSTRUCTIVIZATIONS

被引:2
|
作者
Goncharov, S. S. [1 ]
Bazhenov, N. A. [1 ]
Marchuk, M. I. [1 ]
机构
[1] Novosibirsk State Univ, Sobolev Inst Math, Novosibirsk, Russia
基金
俄罗斯基础研究基金会;
关键词
computable model; strongly constructivizable model; autostability; autostability relative to strong constructivizations; group; 2-step nilpotent group; hyperarithmetical hierarchy; index set; MODELS; CATEGORICITY; SIGNATURE;
D O I
10.1134/S0037446617010104
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We obtain an exact bound for the algorithmic complexity of the class of strongly constructivizable computable groups that are autostable relative to strong constructivizations.
引用
收藏
页码:72 / 77
页数:6
相关论文
共 50 条