Author:
Badaev Serikzhan A.,Manat Mustafa,Sorbi Andrea
Publisher
Springer Science and Business Media LLC
Reference21 articles.
1. Ash, C.J., Knight, J.: Computable Structures and the Hyperarithmetical Hierarchy, volume 144 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam (2000)
2. Badaev, S.A., Goncharov, S.S.: On computable minimal enumerations. In: Yu, L. Ershov, E.I. Khukhro, V.M. Levchuk, Podufalov, N.D. (eds.) Algebra. Proceedings of the Third International Conference on Algebra Held in Krasnoyarsk, August 23–28, 1993, De Gruyter Proceedings in Mathematics, pp. 21–32. Walter de Gruyter, Berlin (1996)
3. Ershov Y.L.: Enumerations of families of general recursive functions. Sib. Math. J. 8(5), 771–778 (1967)
4. Ershov, Y.L.: A hierarchy of sets, I. Algebra Logic, 7(1), 25–43 (1968) Russian
5. Ershov Y.L.: A hierarchy of sets, II. Algebra Log. 7(4), 212–232 (1968)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献