Index sets of autostable relative to strong constructivizations constructive models for familiar classes

This paper calculates, in a precise way, the complexity of the index sets for computable structures that are autostable relative to strong constructivizations and belong to one of the following classes: linear orderings, Boolean algebras, distributive lattices, partial orderings, rings, and commutative semigroups. We also calculate the complexity of the index set for computable structures that have computable dimension n, where n is a fixed natural number greater than 1.