Author:
Badaev S. A.,Goncharov S. S.
Publisher
Springer Science and Business Media LLC
Reference20 articles.
1. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
2. Yu. L. Ershov, Numeration Theory [in Russian], Nauka, Moscow (1977).
3. S. S. Goncharov and A. Sorbi, “Generalized computable numerations and nontrivial Rogers semilattices,” Algebra and Logic, 36, No. 6, 359-369 (1997).
4. S. S. Goncharov, S. Lempp, and D. R. Solomon, “Friedberg numberings of families of n-computably enumerable sets,” Algebra and Logic, 41, No. 2, 81-86 (2002).
5. S. A. Badaev and S. S. Goncharov, “Rogers semilattices of families of arithmetic sets,” Algebra and Logic, 40, No. 5, 281-291 (2001).