Skip to main content
Log in

Second Order Arithmetic and Pulsating Hierarchies

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ganov V. A. and Belyakin N. V., General Theory of Calculations with Oracles [in Russian], Inst. Mat. (Novosibirsk), Novosibirsk (1989).

    Google Scholar 

  2. Belyakin N. V., “Iterated Kleene computability,” Sibirsk. Mat. Zh., 30, no. 6, 27–32 (1989).

    Google Scholar 

  3. Belyakin N. V., “Pulsating hierarchies,” Sibirsk. Mat. Zh., 35, no. 3, 520–526 (1994).

    Google Scholar 

  4. Rogers H., Theory of Recursive Functions and Effective Computability [Russian translation], Mir, Moscow (1972).

    Google Scholar 

  5. Belyakin N. V., “Generalized calculations and the second-order arithmetic,” Algebra i Logika, 9, no. 4, 375–405 (1970).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1013812202344

Keywords

Navigation