Preserving categoricity and complexity of relations

In [Algebra i Logika, 16, No. 3 (1977), 257–282; Ann. Pure Appl. Logic, 136, No. 3 (2005), 219–246; J. Symb. Log., 74, No. 3 (2009), 1047–1060], it was proved that for each computable ordinal $\alpha$, there is a structure that is $\Delta^0_\alpha$ categorical but not relatively $\Delta^0_\alpha$ categorical. The original examples were not familiar algebraic kinds of structures. In [Ann. Pure Appl. Logic, 115, Nos. 1–3 (2002), 71–113], it was shown that for $\alpha=1$, there are further examples in several familiar classes of structures, including rings and $2$-step nilpotent groups. Similar examples for all computable successor ordinals were constructed in [Algebra i Logika, 46, No. 4 (2007), 514–524]. In the present paper, this result is extended to computable limit ordinals. We know of an example of an algebraic field that is computably categorical but not relatively computably categorical. Here we show that for each computable limit ordinal $\alpha>\omega$, there is a field which is $\Delta^0_\alpha$ categorical but not relatively $\Delta^0_\alpha$ categorical. Examples on dimension and complexity of relations are given.