Abstract
Generalizations to various levels of Ershov’s hierarchy of the relationship between n-computable enumerability and relative enumerability are considered.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Yu. L. Ershov, “A certain hierarchy of sets: I,” Algebra i Logika 7(1), 47–74 (1968).
Yu. L. Ershov, “A certain hierarchy of sets: II,” Algebra i Logika 7(4), 15–47 (1968).
Yu. L. Ershov, “A certain hierarchy of sets: III,” Algebra i Logika 9(1), 34–51 (1970).
M. M. Arslanov, G. L. LaForte, and T. A. Slaman, “Relative enumerability in the difference hierarchy,” J. Symbolic Logic 63(2), 411–420 (1998).
M. M. Arslanov, “Degree structures in the local degree theory,” in Lecture Notes in Pure and Appl. Math., Vol. 187: Complexity, Logic, and Recursion Theory (Dekker, New York, 1997), pp. 49–74.
V. L. Selivanov, “The Ershov hierarchy,” Sibirsk. Mat. Zh. 26(1), 134–149 (1985).
Author information
Authors and Affiliations
Additional information
Original Russian Text © I. I. Batyrshin, 2008, published in Matematicheskie Zametki, 2008, Vol. 84, No. 4, pp. 506–515.
Rights and permissions
About this article
Cite this article
Batyrshin, I.I. Relative enumerability in Ershov’s hierarchy. Math Notes 84, 473–482 (2008). https://doi.org/10.1134/S0001434608090198
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0001434608090198