Advertisement

The Equational Theory of 〈ℕ, 0, 1, + , ×, ↑〉 Is Decidable, but Not Finitely Axiomatisable

  • Roberto Di Cosmo
  • Thomas Dufour
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3452)

Abstract

In 1969, Tarski asked whether the arithmetic identities taught in high school are complete for showing all arithmetic equations valid for the natural numbers. We know the answer to this question for various subsystems obtained by restricting in different ways the language of arithmetic expressions, yet, up to now we knew nothing of the original system that Tarski considered when he started all this research, namely the theory of integers under sum, product, exponentiation with two constants for zero and one.

This paper closes this long standing open problem, by providing an elementary proof, relying on previous work of R. Gurevič, of the fact that Tarski’s original system is decidable, yet not finitely aximatisable.

We also show some consequences of this result for the theory of isomorphisms of types.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BDCF02.
    Balat, V., Di Cosmo, R., Fiore, M.: Remarks on isomorphisms in typed lambda calculi with empty and sum type. In: LICS, July 2002, IEEE, Los Alamitos (2002)Google Scholar
  2. BDCF04.
    Balat, V., Di Cosmo, R., Fiore, M.: Extensional normalisation and type-directed partial evaluation for typed lamda calculus with sums. In: 31st Ann. ACM Symp. on Principles of Programming Languages (POPL), pp. 64–76. ACM, New York (2004)Google Scholar
  3. DC95.
    Di Cosmo, R.: Isomorphisms of types: from λ-calculus to information retrieval and language design. Birkhäuser, Basel (1995)CrossRefGoogle Scholar
  4. DP97.
    Dosen, K., Petric, Z.: Isomorphic objects in symmetric monoidal closed categories. Mathematical Structures in Computer Science 7(6), 639–662 (1997)MathSciNetMATHCrossRefGoogle Scholar
  5. DT69.
    Doner, J., Tarski, A.: An extended arithmetic of ordinal numbers. Fundamenta Mathematica 65, 95–127 (1969)MathSciNetMATHGoogle Scholar
  6. Gur85.
    Gurevič, R.: Equational theory of positive numbers with exponentiation. Proceedings of the American Mathematical Society 94(1), 135–141 (1985)MathSciNetMATHGoogle Scholar
  7. Gur90.
    Gurevič, R.: Equational theory of positive numbers with exponentiation is not finitely axiomatizable. Annals of Pure and Applied Logic 49, 1–30 (1990)MathSciNetMATHCrossRefGoogle Scholar
  8. Hen77.
    Henkin, L.: The logic of equality. American Mathematical Monthly 84, 597–612 (1977)MathSciNetMATHCrossRefGoogle Scholar
  9. HR84.
    Henson, C.W., Rubel, L.A.: Some applications of Nevanlinna theory to mathematical logic: Identities of exponential functions. Trans. Am. Math. Soc. 282(1), 1–32 (1984)MathSciNetMATHGoogle Scholar
  10. Mac81.
    Macintyre, A.: The laws of exponentiation. In: Berline, C., McAloon, K., Ressayre, J.-P. (eds.) Model Theory and Arithmetic. Lecture Notes in Mathematics, vol. 890, pp. 185–197. Springer, Heidelberg (1981)CrossRefGoogle Scholar
  11. Mar72.
    Martin, C.F.: Axiomatic bases for equational theories of natural numbers. Notices of the Am. Math. Soc. 19(7), 778 (1972)Google Scholar
  12. Rit90.
    Rittri, M.: Searching program libraries by type and proving compiler correctness by bisimulation. PhD thesis, University of Göteborg, Göteborg, Sweden (1990)Google Scholar
  13. Rog88.
    Rogers Jr., H.: Theory of Recursive Functions and Effective Computability, 2nd edn. The MIT Press, Cambridge (1988)Google Scholar
  14. Sol93.
    Soloviev, S.V.: A complete axiom system for isomorphism of types in closed categories. In: Voronkov, A. (ed.) LPAR 1993. LNCS, vol. 698, pp. 360–371. Springer, Heidelberg (1993)CrossRefGoogle Scholar
  15. Wil81.
    Wilkie, A.J.: On exponentiation—A solution to Tarski’s high school algebra problem. Math. Inst. Oxford University (1981) (preprint)Google Scholar
  16. ZGC03.
    Zibin, Y., Gil, J., Considine, J.: Efficient algorithms for isomorphisms of simple types. In: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 160–171. ACM Press, New York (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Roberto Di Cosmo
    • 1
  • Thomas Dufour
    • 1
  1. 1.PPS LaboratoryUniversité Paris 7France

Personalised recommendations