Skip to main content
SpringerLink
Log in

Some problems of completeness of arithmetic

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

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

Literature Cited

  1. N. V. Belyakin, “On a complete system of classical arithmetic,” Algebra i Logika,6, No. 2, 5–11 (1967).

    Google Scholar 

  2. J. R. Shoenfield, “On a restricted ε-rule,” Bull, Acad. Pol. Sci., Ser. Sci. Math. Astron. et Phys.,7, 405–407 (1959).

    Google Scholar 

  3. S. Ferferman, “Transfinite recursive progressions of axiomatic theories,” Journ. Symb. Logic,27, No. 3, 259–316 (1962).

    Google Scholar 

  4. H. Rogers, Theory of Recursive Functions and Effective Computability, New York (1967).

  5. S. C. Kleene, Introduction to Metamathematics, North-Holland Publishing Co., Amsterdam (1952).

    Google Scholar 

  6. S. Feferman, “Arithmetization of metamathematics in a general setting,” Fund. Math.,49, 35–92 (1960).

    Google Scholar 

  7. A. M. Turing, “Systems of logic based on ordinals, the undecidable,” New York (1965), pp. 154–222.

Download references

Authors
  1. E. A. Derevyankina
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Sibirskii Matematicheskii Zhurnal, Vol. 15, No. 2, pp. 299–317, March–April, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Derevyankina, E.A. Some problems of completeness of arithmetic. Sib Math J 15, 210–223 (1974). https://doi.org/10.1007/BF00968286

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00968286

Search

Navigation