Author:
Hirschfeldt Denis R.,Khoussainov Bakhadyr,Shore Richard A.,Slinko Arkadii M.
Reference41 articles.
1. Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees;Ash;Trans. Amer. Math. Soc.,1986
2. Intrinsically recursive relations;Ash,1981
3. R. Camerlo, S. Gao, The completeness of the isomorphism relation for countable Boolean algebras, Trans. Amer. Math. Soc., to appear.
4. Computably categorical structures and expansions by constants;Cholak;J. Symbolic Logic,1999
5. R. Downey, J.B. Remmel, Questions in computable algebra and combinatorics, in: P.A. Cholak, S. Lempp, M. Lerman, R.A. Shore (Eds.), Computability Theory and its Applications (Boulder, CO, 1999), Contemp. Math., Vol. 257, Amer. Math. Soc., Providence, RI, 2000, pp. 95–125.
Cited by
116 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献