|
Iterated Kleene computability and the superjump
N. V. Beljakin
Abstract:
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.
Received: 03.06.1975
Citation:
N. V. Beljakin, “Iterated Kleene computability and the superjump”, Mat. Sb. (N.S.), 101(143):1(9) (1976), 21–43; Math. USSR-Sb., 30:1 (1976), 17–37
Linking options:
https://www.mathnet.ru/eng/sm2939https://doi.org/10.1070/SM1976v030n01ABEH001896 https://www.mathnet.ru/eng/sm/v143/i1/p21
|
Statistics & downloads: |
Abstract page: | 254 | Russian version PDF: | 93 | English version PDF: | 7 | References: | 39 |
|