The Equational Theory of ( N , 0, 1, +, ×, uparrow ) Is Decidable, but Not Finitely Axiomatisable

Roberto Di Cosmo (1) , Thomas Dufour (1)

1 PPS - Preuves, Programmes et Systèmes

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. Gureviccaron, of the fact that Tarskirsquos original system is decidable, yet not finitely aximatisable. We also show some consequences of this result for the theory of isomorphisms of types.

Domaines: Logique en informatique [cs.LO]; Logique [math.LO]

Roberto Di Cosmo, Thomas Dufour. The Equational Theory of ( N , 0, 1, +, ×, uparrow ) Is Decidable, but Not Finitely Axiomatisable. 11th International Conference, LPAR 2004, Feb 2005, Montevideo, Uruguay. pp.240-256, ⟨10.1007/b106931⟩. ⟨hal-00149562⟩