|
This article is cited in 2 scientific papers (total in 2 papers)
Turing jumps in the Ershov hierarchy
M. Kh. Faizrakhmanov Kazan (Volga Region) Federal University, Kazan, Russia
Abstract:
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^{-1}_a$-levels, where $a$ stands for an ordinal $\omega^n>1$.
Keywords:
Turing jumps, Ershov hierarchy, constructive ordinals, superlow sets.
Received: 21.06.2008 Revised: 16.03.2011
Citation:
M. Kh. Faizrakhmanov, “Turing jumps in the Ershov hierarchy”, Algebra Logika, 50:3 (2011), 399–414; Algebra and Logic, 50:3 (2011), 279–289
Linking options:
https://www.mathnet.ru/eng/al493 https://www.mathnet.ru/eng/al/v50/i3/p399
|
Statistics & downloads: |
Abstract page: | 395 | Full-text PDF : | 291 | References: | 60 | First page: | 14 |
|