# zbMATH — the first resource for mathematics

The index set of linear orderings that are autostable relative to strong constructivizations. (Russian) Zbl 1349.03036
Summary: 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.

##### MSC:
 03C57 Computable structure theory, computable model theory 03D45 Theory of numerations, effectively presented structures
Full Text: