Abstract
We implement the machine-oracle modeling of second order arithmetic by means of the iterated Kleene computability. The sought oracle is constructed by using a pulsating transfinite process which is a modification of a similar process used by N. V. Belyakin for solving a particular instance of this problem.
Similar content being viewed by others
References
Ganov V. A. and Belyakin N. V., General Theory of Calculations with Oracles [in Russian], Inst. Mat. (Novosibirsk), Novosibirsk (1989).
Belyakin N. V., “Iterated Kleene computability,” Sibirsk. Mat. Zh., 30, no. 6, 27–32 (1989).
Belyakin N. V., “Pulsating hierarchies,” Sibirsk. Mat. Zh., 35, no. 3, 520–526 (1994).
Rogers H., Theory of Recursive Functions and Effective Computability [Russian translation], Mir, Moscow (1972).
Belyakin N. V., “Generalized calculations and the second-order arithmetic,” Algebra i Logika, 9, no. 4, 375–405 (1970).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gailit, E.V. Second Order Arithmetic and Pulsating Hierarchies. Siberian Mathematical Journal 43, 22–27 (2001). https://doi.org/10.1023/A:1013812202344
Issue Date:
DOI: https://doi.org/10.1023/A:1013812202344