First-order reasoning and primitive recursive natural number notations (Q708925)

The paper is devoted to the reliability of first-order derivations in axiomatic elementary number theory in the case when the collection of its models is enlarged by including ``primitive recursive notations''. Two of such derivations are criticized, in particular derivations which claim, respectively, to establish the totality of exponentiation and to prove Euclid's theorem about the infinity of primes.