This is a preview of subscription content, log in via an institution to check access.
References
S. C. Kleene, “Recursive functionals and quantifiers of finite types. I,” Trans. Amer. Math. Soc.,91, 1–52 (1959).
S. C. Kleene, “Turing-machine computable functionals of finite types. I,” in: Logic, Methodology and Philosophy of Science [Russian translation], Mir, Moscow, 1965, pp. 38–45.
N. V. Belyakin, “Generalized calculations and the second-order arithmetic,” Algebra i Logika,9, No. 4, 375–405 (1970).
V. A. Ganov, “Generalized computability and the descriptive set theory,” Sibirsk. Mat. Zh.,15, No. 6, 1242–1261 (1974).
E. G. Nikiforova, “On a generalization of the iterated Kleene computability,” submitted to VINITI, 1986, No. 5638-V86.
S. C. Kleene, Introduction to Metamathematics [Russian translation], Izdat. Inostr. Lit., Moscow (1957).
H. Rogers Jr., Theory of Recursive Functions and Effective Computability [Russian translation], Mir, Moscow (1972).
V. A. Ganov and N. V. Belyakin, General Theory of Calculations with Oracles [in Russian], Inst. Mat. (Novosibirsk), Novosibirsk (1989).
N. V. Belyakin, “Iterated Kleene computability,” Sibirsk. Mat. Zh.,30, No. 6, 26–41 (1989).
L. N. Pobedin, “Some questions of generalized computability,” Algebra i Logika,12, No. 2, 220–231 (1973).
L. N. Pobedin, “The halting problem and hierarchy theory,” Algebra i Logika,14, No. 2, 186–303 (1975).
Author information
Authors and Affiliations
Additional information
Translated fromSibirskiî Matematicheskiî Zhurnal, Vol. 35, No. 5, pp. 1138–1147, September–October, 1994.
Rights and permissions
About this article
Cite this article
Pobedin, L.N. Computability with two-place oracle. Sib Math J 35, 1014–1021 (1994). https://doi.org/10.1007/BF02104579
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02104579