Geodesic
Iterated Kleene computability and the superjump
Sbornik. Mathematics, Tome 30 (1976) no. 1, pp. 17-37

Voir la notice de l'article provenant de la source Math-Net.Ru

Recursive hierarchies obtained by iterating the well-known version, developed by S. C. Kleene, of recursiveness relative to objects of type $\leqslant2$ are studied in the article. Iteration is carried out over ordinal indexings which, in a definite sense, are effectively constructed. An estimate is given for classes corresponding to critical points of the hierarchies under consideration. Bibliography: 10 titles. 
@article{SM_1976_30_1_a1,
     author = {N. V. Beljakin},
     title = {Iterated {Kleene} computability and the superjump},
     journal = {Sbornik. Mathematics},
     pages = {17--37},
     publisher = {mathdoc},
     volume = {30},
     number = {1},
     year = {1976},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SM_1976_30_1_a1/}
}
TY  - JOUR
AU  - N. V. Beljakin
TI  - Iterated Kleene computability and the superjump
JO  - Sbornik. Mathematics
PY  - 1976
SP  - 17
EP  - 37
VL  - 30
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SM_1976_30_1_a1/
LA  - en
ID  - SM_1976_30_1_a1
ER  - 
%0 Journal Article
%A N. V. Beljakin
%T Iterated Kleene computability and the superjump
%J Sbornik. Mathematics
%D 1976
%P 17-37
%V 30
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SM_1976_30_1_a1/
%G en
%F SM_1976_30_1_a1
N. V. Beljakin. Iterated Kleene computability and the superjump. Sbornik. Mathematics, Tome 30 (1976) no. 1, pp. 17-37. http://geodesic.mathdoc.fr/item/SM_1976_30_1_a1/