Skip to main content
SpringerLink
Log in

Second Order Arithmetic and Autonomous Computability

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

Abstract

An autonomous process can be described within the second order arithmetic or within the closely related Zermelo–Fraenkel theory (without the powerset axiom), which is convenient. The following key result is proved: If some autonomous oracle gives rise to a model for the second-order arithmetic then it automatically gives a model for Zermelo–Fraenkel theory (without the powerset axiom). The latter is naturally interpreted on hereditarily countable sets which are easily representable by countable trees satisfying the chain condition. In general, every autonomous process can be described in Zermelo–Fraenkel theory (without the powerset axiom); moreover, the description is absolute for every oracle model. Hence, there is no autonomous process yielding a model for the complete theory of the second order arithmetic.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ga?lit E. V., “Second order arithmetic and pulsating hierarchies,” Sibirsk. Mat. Zh., 43, No. 1, 33–40 (2002).

    Google Scholar 

  2. Ga?lit E. V., “Modeling of the pulsating process,” Algebra i Logika (2002) (to appear).

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

    Google Scholar 

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

    Google Scholar 

  5. Mendelson E., Introduction to Mathematical Logic [Russian translation], Nauka, Moscow (1976).

    Google Scholar 

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

    Google Scholar 

  7. Nikiforova E. G., “On one generalization of iterated Kleene computability,” submitted to VINITI, No. 5638-B86.

  8. Belyakin N. V., “Effective hierarchies,” Algebra i Logika, 29, No. 4, 385–397 (1990).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Novosibirsk State University, Novosibirsk

    E. V. Gailit

Authors
  1. E. V. Gailit
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gailit, E.V. Second Order Arithmetic and Autonomous Computability. Siberian Mathematical Journal 44, 244–249 (2003). https://doi.org/10.1023/A:1022976602764

Download citation

  • Issue Date:

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

Search

Navigation