Roberto Di Cosmo, Thomas Dufour. The Equational Theory of < N, 0, 1, +, ×, uparrow > Is Decidable, but Not Finitely Axiomatisable. In Franz Baader, Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, 11th International Conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings. Volume 3452 of Lecture Notes in Computer Science, pages 240-256, Springer, 2004. [doi]
Abstract is missing.