1. Yu. L. Ershov, The Theory of Numerations [in Russian], Nauka, Moscow (1977).
2. A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).
3. S. S. Marchenkov, "On computable numerations of families of general recursive functions," Algebra Logika,11, No. 5, 588–607 (1972).
4. H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).
5. A. B. Khutoretskii, "Two existence theorems for computable numerations," Algebra Logika,8, No. 4, 483–492 (1969).