RUS  ENG
Full version
JOURNALS // Algebra i logika // Archive

Algebra Logika, 2011 Volume 50, Number 3, Pages 399–414 (Mi al493)

This article is cited 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.

UDC: 510.53

Received: 21.06.2008
Revised: 16.03.2011


 English version:
Algebra and Logic, 2011, 50:3, 279–289

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024