My question is stated in bold text.
This question pertains to the following formulation of Peano's axioms used to formalize an introduction of the natural numbers (beginning with 1) consisting of successions of vertical strokes drawn on paper in horizontal rows.
- I. $1$ is a number.
- II. To every number $a$ there corresponds a unique number $a^{\prime},$ called its successor.
- III. If $a^{\prime}=b^{\prime},$ then $a=b.$
IV. $a^{\prime}\ne1$ for every number $a.$
V. Let $A\left(x\right)$ be a proposition containing the variable $x.$ If $A\left(1\right)$ holds and if $A\left(n^{\prime}\right)$ follows from $A\left(n\right)$ for every number $n,$ then $A\left(x\right)$ holds for every number $x.$
Are these axioms sufficient to determine the natural numbers $\mathbb{N}\equiv\left\{ 1,2,3,\dots\right\} ?$ Or is it necessary to add a further requirement that a number must inherit its membership in $\mathbb{N}$ from $1?$
For example, it seems that the set $\mathcal{N}=\mathbb{N}\cup\left\{ h\vert i\in\mathbb{Z}\land h=i+\frac{1}{2}\right\} $ is consistent with these axioms, with $a^{\prime}\equiv a+1,$ in the standard sense.
I propose that the following statement would fulfill such a requirement: The set of natural numbers contains the number $1$ as well as every number reached successively beginning with $1,$ with succession conforming to Peano's axioms as stated.
That avoids explicit reference to a "successor function", which would require additional definitions. Nonetheless, any such requirement stated in addition to Peano's axioms seems to presuppose ordering. Terms such as beginning with, repeated application, successively, inherited from, etc., appeal to our a priori notions of ordering. So I'm left wondering to what extent our subsequent theorems pertaining to ordering are actually derived results.
Yes, the (first-order) theory PA is not sufficient for characterizing $\mathbb{N}$ up to isomorphism.
In fact, no first-order theory can do the job for any infinite structure at all! This is a consequence of the compactness theorem:
Suppose $\mathcal{A}$ is an infinite structure in a language $\Sigma$ and $\Gamma$ is a set of sentences true in $\mathcal{A}$.
Fix a cardinal $\kappa>\vert\Gamma\vert$, and let $\Sigma^*$ be the language gotten by adding $\kappa$-new constant symbols $\{c_\eta:\eta<\kappa\}$ to $\Sigma$.
Let $\Gamma^*=\Gamma\cup\{c_\eta\not=c_\theta:\eta<\theta<\kappa\}$.
By the compactness theorem, $\Gamma^*$ has a model - any finite subset of $\Gamma^*$ can only mention finitely many of the new constants, so an appropriate expansion of $\mathcal{A}$ will do the job.
But any model of $\Gamma^*$ has cardinality $\ge\kappa$ - hence can't be $\mathcal{A}$ itself. But the reduct of such a model to the original language $\Sigma$ is a model of $\Gamma$, so there are $\Sigma$-structures satisfying $\Gamma$ which aren't (isomorphic to) $\mathcal{A}$.
(Note that the original formulation of PA was as a second-order theory; second-order logic can indeed capture $\mathbb{N}$ up to isomorphism.)