Publisher
Springer Science and Business Media LLC
Reference9 articles.
1. S. S. Goncharov and A. Sorbi, “Generalized computable numerations and nontrivial Rogers semilattices,” Algebra and Logic, 36, No. 6, 359-369 (1997).
2. S. A. Badaev and S. S. Goncharov, “Theory of numberings: Open problems,” in Computability Theory and Its Applications, Cont. Math., 257, Am. Math. Soc., Providence, RI (2000), pp. 23-38.
3. S. A. Badaev and Zh. T. Talasbaeva, “Computable numberings in the hierarchy of Ershov,” Mathematical Logic in Asia, S. S. Goncharov (Ed.), World Scientific, NJ, 17-30 (2006).
4. Yu. L. Ershov, Numeration Theory [in Russian], Nauka, Moscow (1977).
5. C. J. Ash and J. F. Knight, Computable Structures and the Hyperarithmetical Hierarchy, Stud. Log. Found. Math., 144, Elsevier, Amsterdam (2000).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献