1. Morozov A. S., “On the theories of classes of recursive permutation groups,” Siberian Adv. Math., 1, No. 1, 138–153 (1991).
2. Truss J. and Morozov A. C., “On computable automorphisms of the rational numbers,” J. Symbolic Logic, 66, 1458–1470 (2001).
3. Barwise J., Admissible Sets and Structures, Springer-Verlag, Berlin; Göttingen; Heidelberg (1975).
4. Ershov Yu. L., Computability and Definability, Kluwer Academic/Plenum Publishers, New York (1996) (Ser. Siberian School of Algebra and Logic).
5. Ershov Yu. L., “Σ-Definability of algebraic systems,” in: Handbook of Recursive Mathematics. Vol. 1, Chapter 5, Elsevier, Amsterdam; Lausanne; New York; Oxford; Shannon; Singapore; Tokyo, 1998, pp. 235–260.