This is a preview of subscription content, log in via an institution to check access.
Literature cited
P. Aczel, "Representability in some systems of second-order arithmetic," Israel J. Math.,8, No. 4, 309–328 (1970).
S. C. Kleene, "Turing-machine computable functions of finite types I" in: Logic, Methodology, and Philosophy of Science, Proceedings of the 1960 International Congress, Stanford (1962), pp. 38–45.
S. C. Kleene, "Turing-machine computable functionals of finite types II," Proc. London Math. Soc.,12, No. 46 245–258 (1962).
N. V. Belyakin, "On one class of recursive hierarchies," Algebra i Logika,12, No. 1, 3–21 (1973).
S. C. Kleene, Introduction to Metamathematics, Van Nostrand, Princeton (1952).
R. A. Piatek, "Foundations of recursion theory," Dissertation, Stanford University (1966).
N. V. Belyakin, "Generalized computations and second-degree arithmetic," Algebra i Logika,9, No. 4, 375–405 (1970).
A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka (1965).
H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
S. C. Kleene, "Recursive functionals and quantifiers of finite types I," Trans. Amer. Math. Soc.,91, 1–52 (1959).
Additional information
Translated from Algebra i Logika, Vol. 12, No. 5, pp. 497–511, September–October, 1973.
Rights and permissions
About this article
Cite this article
Amstislavskii, V.I. On computability with functionals. Algebr Logic 12, 277–286 (1973). https://doi.org/10.1007/BF02218586
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02218586