Abstract:
We obtain an exact bound for the algorithmic complexity of the class of strongly constructivizable computable groups that are autostable relative to strong constructivizations.
Keywords:
computable model, strongly constructivizable model, autostability, autostability relative to strong constructivizations, group, 2-step nilpotent group, hyperarithmetical hierarchy, index set.
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
(Grant NSh-6848.2016.1).
Citation:
S. S. Goncharov, N. A. Bazhenov, M. I. Marchuk, “The index set of the groups autostable relative to strong constructivizations”, Sibirsk. Mat. Zh., 58:1 (2017), 95–103; Siberian Math. J., 58:1 (2017), 72–77