Sibirsk. Mat. Zh., 2017, Volume 58, Number 1, Pages 95–103
The index set of the groups autostable relative to strong constructivizations
S. S. Goncharovab, N. A. Bazhenovab, M. I. Marchukab
a Sobolev Institute of Mathematics, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
We obtain an exact bound for the algorithmic complexity of the class of strongly constructivizable computable groups that are autostable relative to strong constructivizations.
computable model, strongly constructivizable model, autostability, autostability relative to strong constructivizations, group, $2$-step nilpotent group, hyperarithmetical hierarchy, index set.
|Russian Foundation for Basic Research
|Ministry of Education and Science of the Russian Federation
|The first author was supported by the Russian Foundation for Basic Research (Grant 14-01-00376). The second
author was supported by the Russian Foundation for Basic Research (Grant 16-31-60058-mol_a_dk). The third
author was supported by the State Maintenance Program for the Leading Scientific Schools of the Russian Federation
Siberian Mathematical Journal, 2017, 58:1, 72–77
Citing articles on Google Scholar:
Related articles on Google Scholar: