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.