1. J. Barwise, Admissible Sets and Structures, Springer, Berlin (1975).
2. Yu. L. Ershov, Definability and Computability, Sib. School Alg. Log. [in Russian], Nauch. Kniga, Novosibirsk (1996).
3. Yu. L. Ershov, “Σ-Definability of algebraic systems,” in Handbook of Recursive Mathematics, Vol. 1, Recursive Model Theory, Stud. Log. Found. Math., 138, Elsevier, Amsterdam (1998), pp. 235–260.
4. M. V. Korovina, “Generalized computability of functions on real numbers,” Vych. Sist., 133, 38–67 (1990).
5. Yu. L. Ershov, V. G. Puzarenko, and A. I. Stukachev, “HF-Computability,” in Computability in Context. Computation and Logic in the Real World, S. B. Cooper and A. Sorbi (eds.), World Scientific, London (2011), pp. 173–248.