1. Ershov Yu. L., Definability and Computability [Russian], Nauchnaya Kniga, Novosibirsk; Èkonomika, Moscow (2000) (Siberian School of Algebra and Logic).
2. Rogers H., Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Comp., New York, St. Louis, San Francisco, Toronto, London, and Sydney (1967).
3. Rudnev V. A., “A universal recursive function on admissible sets,” Algebra and Logic, vol. 25, no. 4, 267–273 (1986).
4. Ershov Yu. L., Puzarenko V. G., and Stukachev A. I., “$$\mathbb{HF}$$-computability,” in: Computability in Context, Imp. Coll. Press, London, 2011, 169–242 (Computation and Logic in the Real World).
5. Morozov A. S. and Puzarenko V. G., “Σ-Subsets of natural numbers,” Algebra and Logic, vol. 43, no. 3, 162–178 (2004).