We look at infinite levels of the Ershov hierarchy in the natural system of notation, which are proper for jumps of sets. It is proved that proper infinite levels for jumps are confined to \( \Delta_a^{ - 1} \) -levels, where a stands for an ordinal ωn > 1.
Similar content being viewed by others
References
Yu. L. Ershov, “On a hierarchy of sets I,” Algebra Logika, 7, No. 1, 47–73 (1968).
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).
M. M. Arslanov, The Ershov Hierarchy, A Special Course in Mathematics, Kazan State Univ., Kazan (2007).
H. G. Carstens, “\( \Delta_2^0 \) -Mengen,” Arch. Math. Logik Grundl., 18, 55–65 (1976).
B. Schaeffer, “Dynamic notions of genericity and array noncomputability,” Ann. Pure Appl. Log., 95, Nos. 1–3, 37–69 (1998).
S. Walk, “Towards a definition of the array computable degrees,” Ph. D. Thesis, Univ. Notre Dame (1999).
I. Sh. Kalimullin, “Some notes on degree spectra of the structures,” Lect. Notes Comput. Sci., 4497, Springer-Verlag, Berlin (2007), pp. 389–397.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by RFBR (project Nos. 09-01-97010, 10-01-00399, MK-1784.2010.1), by the Federal Program “Scientific and Scientific-Pedagogical Cadres of Innovative Russia” (gov. contracts P267 and 14.740.11.1142), and by the Russian Ministry of Education through the Analytical Departmental Target Program (ADTP) “Development of Scientific Potential of the Higher School of Learning” (project No. 2.1.1/5367).
Translated from Algebra i Logika, Vol. 50, No. 3, pp. 399–414, May-June, 2011.
Rights and permissions
About this article
Cite this article
Faizrakhmanov, M.K. Turing jumps in the Ershov hierarchy. Algebra Logic 50, 279–289 (2011). https://doi.org/10.1007/s10469-011-9141-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10469-011-9141-x