1. Soare R. I., Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets, Springer-Verlag, Berlin (1987).
2. Barwise J., Admissible Sets and Structures, Springer-Verlag, Berlin, Göttingen, and Heidelberg (1975).
3. Ershov Yu. L., Definability and Computability, Plenum Publ. Co., New York (1996).
4. Ershov Yu. L., Puzarenko V. G., and Stukachev A. I., “HF-Computability,” in: Computability in Context. Computation and Logic in the Real World, Imperial College Press, London, 2011, 169–242.
5. Korovina M. V., “Generalized computability of real functions,” Siberian Adv. Math., no. 2(4), 1–18 (1992).