The index set of linear orderings that are autostable relative to strong constructivizations

We prove that a computable ordinal $\alpha$ is autostable relative to strong constructivizations if and only if $\alpha<\omega^{\omega+1}$. We calculate, in a precise way, the complexity of the index set for linear orderings that are autostable relative to strong constructivizations.