Skip to main content
Springer Nature Link
Log in

The completeness of Peano multiplication

  • Published:
Save article
View saved research
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

It is shown that the set of all theorems of Peano Arithmetic which mention only multiplication is a complete theory in the corresponding restricted language. The notion of a complete decidable covering of a theory is introduced.

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

Access this article

Log in via an institution

Subscribe and save

Springer+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

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

Explore related subjects

Discover the latest articles, books and news in related subjects, suggested using machine learning.

References

  1. P. Cegielski,Theorie elementaire de la multiplication des entiers naturel Doctoral dissertation, University Pierre et Marie Curie, Paris 6, 1980.

    Google Scholar 

  2. A. Ehrenfeucht and G. Kreisel,Strong models for Arithmetic, Bull. Acad. Polon. Sci.14 (1966), 107–110.

    MATH  MathSciNet  Google Scholar 

  3. Yu. Ershov,Decidability of relatively complemented distributive lattices and the theory of filters, Algebra i Logika3 (1964), 17–38.

    MATH  Google Scholar 

  4. S. Feferman and R. Vaught,First order properties of products of algebraic systems, Fund. Math.47 (1959), 57–102.

    MATH  MathSciNet  Google Scholar 

  5. D. Jensen and A. Ehrenfeucht,Some problems in elementary arithmetics, Fund. Math.92 (1976), 223–245.

    MATH  MathSciNet  Google Scholar 

  6. L. Lipshitz and M. Nadel,The additive structure of models of arithmetic, Proc. Amer. Math. Soc.68 (3) (1978), 331–336.

    Article  MATH  MathSciNet  Google Scholar 

  7. A. Malcev,Axiomatizable classes of locally free algebras of various types, in chapter 23,The Metamathematics of Algebraic Systems, North-Holland, 1971.

  8. A. Mostowski,On direct products of theories, J. Symbolic Logic17 (1952), 1–31.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. Paris and L. Harrington,A mathematical incompleteness in Peano Arithmetic, inHandbook of Mathematical Logic, North-Holland, 1977.

  10. M. Presburger,Uber die vollstandigkeit eines gewissen Systems der Arithmetic ganzer zahlen, in welchen die Addition als einzige Operation hervortritt, Comptes-rendus du I Congres de Mathematiciens des Pays Slaves, Warsaw, 1929, pp. 92–101.

  11. T. Skolem,Untersuchungen uber die Axiome des Klassenkalkuls und uber die “Productations und Summationsprobeleme”, welche gewissen Klassen von Aussagen betreffen, 1919; reprinted inSelected Works in Logic, Scandinavian University Books, 1970.

  12. T. Skolem,Uber einige Salzfunktionen in der Arithmetik, V. A. Skr.1 (7) (1930), 1–28.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Notre Dame, 46556, Notre Dame, IN, USA

    Mark E. Nadel

Authors
  1. Mark E. Nadel
    View author publications

    Search author on:PubMed Google Scholar

Additional information

The author was partially supported by N.S.F. Grant No. MC578-02224.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nadel, M.E. The completeness of Peano multiplication. Israel J. Math. 39, 225–233 (1981). https://doi.org/10.1007/BF02760851

Download citation

  • Received:

  • Revised:

  • Issue date:

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

Keywords