1. Goncharov S.S. and Sorbi A., “Generalized computable numerations and nontrivial Rogers semilattices,” Algebra Logic, vol. 36, no. 6, 359–369 (1997).
2. Rogers H., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, St. Louis, San Francisco, Toronto, London, and Sydney (1967).
3. Ershov Yu.L., Theory of Numberings, Nauka, Moscow (1977) [Russian].
4. Ershov Yu.L., Theory of Numberings. Handbook of Computability Theory, Elsevier, Amsterdam (1999) (Stud. Logic Found. Math.; vol. 140).
5. Khutoretskii A.B., “On the cardinality of the upper semilattice of computable enumerations,” Algebra Logic, vol. 10, no. 5, 348–352 (1971).