Publisher
Springer Science and Business Media LLC
Reference7 articles.
1. Yu. L. Ershov, Theory of Numerations [in Russian], Nauka, Moscow (1977).
2. A. N. Degtev, “The semilattice of computable families of recursively enumerable sets,” Mat. Zametki, 50, No. 4, 61-66 (1991).
3. R. I. Soare, Recursively Enumerable Sets and Degrees, Perspect. Math. Log., Omega Ser., Springer-Verlag, Heidelberg (1987).
4. S. A. Badaev, “Positive enumerations,” Sib. Math. J., 18, No. 3, 343-352 (1977).
5. S. A. Badaev and S. S. Goncharov, “Generalized computable universal numberings,” Algebra and Logic, 53, No. 5, 355-364 (2014).