Article PDF
Avoid common mistakes on your manuscript.
Literature cited
H. Rogers, Theory of Recursive Functions and Effective Computability [Russian translation], Mir, Moscow (1972).
Yu. L. Ershov, "On a hierarchy of sets. II," Algebra Logika,7, No. 4, 15–47 (1968).
Yu. L. Ershov, "On a hierarchy of sets. III," Algebra Logika,9, No. 1, 34–51 (1970).
V. L. Selivanov, "The Ershov hierarchy," Sib. Mat. Zh.,26, No. 1, 134–149 (1985).
Sh. T. Ishmukhametov, "Differences of recursively enumerable sets, their degrees of undecidability and index sets," Doctoral Dissertation, Kazan Univ. (1986).
C. Jockusch and R. Shore, "Pseudo-jump operators. II," J. Symb. Logic,49, No. 4, 1205–1236 (1984).
R. Epstein, R. Haas, and R. Kramer, "Hierarchies of sets and degrees below0'," Lect. Notes Math., No. 859 (1981).
A. H. Lachlan, "Two theorems on many-one degrees of recursively enumerable sets," Algebra Logika,11, No. 2, 216–229 (1972).
Additional information
Translated from Algebra i Logika, Vol. 27, No. 4, pp. 464–478, July–August, 1988.
Rights and permissions
About this article
Cite this article
Selivanov, V.L. Ershov hierarchy and the t-jump. Algebra and Logic 27, 292–301 (1988). https://doi.org/10.1007/BF01978401
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01978401