Search

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.

We obtain estimates for the algorithmic complexity of index sets for the class of decidable autostable models and the class of computable models that possess strong constructivizations and are autostable under strong constructivizations.