Abstract:
It is proved that every computable ordinal has a degree of autostability. We construct new examples of degrees of autostability in the class of linear orderings and in the class of linearly ordered Abelian groups.
Keywords:autostability, computable categoricity, index set, linear ordering, autostability spectrum, categoricity spectrum, degree of autostability, degree of categoricity, ordered Abelian group.