Skip to main content
SpringerLink
Log in

Undecidable problems of elementary number theory

  • Published:
Mathematische Annalen 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

References

  1. Gödel, Kurt: Die Vollständigkeit der Axiome des logischen Funktionenkalküls. Mh. Math. Phys.37, 349–360 (1930).

    Google Scholar 

  2. Henkin, Leon: The completeness of the first order functional calculus. J. Symb. Log.14, 159–166 (1949).

    Google Scholar 

  3. Henkin, Leon: Completeness in the theory of types. J. Symb. Log.15, 81–91 (1950).

    Google Scholar 

  4. For a discussion of this result and its history seeAlonzo Church, Introduction to Mathematical Logic, Volume I, Princeton University Press (1956), § 45. In this book we also find simple discussions ofGödel's (§ 44) andHenkin's (§ 54) completeness theorems.

  5. Thoralf Skolem: Über die Nicht-Charakterisierbarkeit der Zahlenreihe mittels endlich oder abzählbar unendlich vieler Aussagen mit ausschließlich Zahlenvariablen. Fund. Math.23, 150–161 (1934).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dartmouth College, USA

    John G. Kemeny

Authors
  1. John G. Kemeny
    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

Kemeny, J.G. Undecidable problems of elementary number theory. Math. Ann. 135, 160–169 (1958). https://doi.org/10.1007/BF01343100

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation