Reference11 articles.
1. [1] Arslanov, M. M., “The Ershov hierarchy,” pp. 49–100 in Computability in Context, edited by S. B. Cooper and A. Sorbi, Imperial College Press, London, 2011.
2. [2] Arslanov, M. M., G. L. LaForte, and T. A. Slaman, “Relative enumerability in the difference hierarchy,” Journal of Symbolic Logic, vol. 63 (1998), pp. 411–20.
3. [3] Cai, M., R. A. Shore, and T. A. Slaman, “The $n$-r.e. degrees: Undecidability and $\Sigma _{1}$ substructures,” Journal of Mathematical Logic, vol. 12 (2012), art. ID 1250005.
4. [4] Cooper, S. B., L. Harrington, A. H. Lachlan, S. Lempp, and R. I. Soare, “The d.r.e. degrees are not dense,” Annals of Pure and Applied Logic, vol. 55 (1991), pp. 125–51.
5. [5] Cooper, S. B., and X. Yi, “Isolated d.r.e. degrees,” University of Leeds, Department of Pure Mathematics, Preprint Series 17, 1995.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献