# Extension of the Peano Axioms?

The Peano Axioms (partially) formalize our intuitive notion of arithmetic. Partially because they also describe the behaviour of nonstandard models and there are some theorems that they can not prove that might seem, at first sight, to be within their domain e.g. Goodstein's Theorem and some of Harvey Friedman's combinatorial theorems http://arxiv.org/abs/math/9811187. So there is room for some clever soul to find additional axioms which would be independent of PA and also convey a natural intuitive property of the integers. These additional axioms would prove new theorems and also restrict the class of nonstandard models.

Could such a process ever be complete in the sense that all nonstandard models would be excluded?

PS I read the FAQ and am not sure if this is a suitable question. My apologies if it is not.

Larry Wickert, Truth or Consequences, New Mexico

-
Not if you restrict to first-order axioms, thanks to Lowenheim-Skolem: en.wikipedia.org/wiki/L%C3%B6wenheim%E2%80%93Skolem_theorem . If you don't, then see en.wikipedia.org/wiki/… . –  Qiaochu Yuan Oct 17 '11 at 1:18
I suspect that the OP means something nonstandard by "nonstandard," namely not elementarily equivalent to the standard model. The theory of all first-order propositions that hold true in the standard model would only have models elementarily equivalent to the standard model, but this theory would lack even a recursive axiomatization, by Godel. –  David Feldman Oct 17 '11 at 4:49

There is no hope for a first-order theory to eliminate non-standard models. If a first-order theory over a countable language has an infinite model then it has models of all infinite cardinalities (Löwenheim-Skolem Theorem). In the case of a theory $T$ of arithmetic. If the standard model satisfies $T$, then $T$ must have an uncountable model, which has to be non-standard (though there will be countable non-standard models of $T$ as well).

If you formulate PA in second-order logic, then it is already complete with respect to the standard semantics.

-
Alternatively, one can use Los's theorem instead of Lowenheim-Skolem: the ultrapower ${}^* {\bf N}$ of ${\bf N}$ obeys all the first order sentences that the natural numbers do, but is clearly a non-isomorphic model of arithmetic. –  Terry Tao Oct 17 '11 at 2:57
Yes, and a simple compactness trick will also do it. In fact, it seems that it is hard not to prove that there are nonstandard models! –  François G. Dorais Oct 17 '11 at 3:30

There is a stronger result than the ones stated. As noted above, by compactness (and the L\"owenheim-Skolem theorems) we have a lot of nonstandard models.

However, by G\"odel's First Incompleteness Theorem, we have that no recursive (consistent) extension of PA can be complete. So, no finite set of axioms (or even axiom schemes, like induction) can ever even nail down the complete theory of arithmetic. Not only will there be nonstandard models, but there will be models which satisfy statements which are not "true."

-