1. Yu. L. Ershov, Numeration Theory [in Russian], Nauka, Moscow (1977).
2. Yu. L. Ershov, Definability and Computability, Sib. School Alg. Log. [in Russian], 2nd ed., Ekonomika, Moscow (2000).
3. I. Sh. Kalimullin and V. G. Puzarenko, “Computability principles on admissible sets,” Mat. Trudy, 7, No. 2, 35-71 (2004).
4. R. I. Soare, Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets, Persp. Math. Log., Omega Ser., Springer, Berlin (1987).
5. S. S. Goncharov and A. Sorbi, “Generalized computable numerations and nontrivial Rogers semilattices,” Algebra and Logic, 36, No. 6, 359-369 (1997).