1. Yu. L. Ershov, Numeration Theory [in Russian], Nauka, Moscow (1977).
2. V. G. Puzarenko, “A semilattice of numberings,” Mat. Tr., 12, No. 2, 170–209 (2009).
3. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
4. R. I. Soare, Recursively Enumerable Sets and Degrees, A Study of Computable Functions and Computably Generated Sets, Springer, Berlin (1987).
5. Yu. L. Ershov, Definability and Computability, Sib. School Alg. Log. [in Russian], Nauch. Kniga, Novosibirsk, Ekonomika, Moscow (2000).