Peano Axioms

The Peano axioms are a collection of axioms describing the natural numbers through a distinguished starting element, a successor operation, and an induction principle. They provide an abstract foundation for arithmetic, specifying the structure of counting numbers without identifying numbers with particular physical objects or sets. Their interpretation depends on the underlying logic: the second-order formulation characterizes the natural numbers uniquely up to structural equivalence, whereas first-order Peano arithmetic admits additional, nonstandard models. (mathshistory.st-andrews.ac.uk)

Historical background

The axioms are named after Giuseppe Peano, who published his treatment of arithmetic in the 1889 Latin work Arithmetices principia, nova methodo exposita. Richard Dedekind had published a closely related analysis of natural numbers the previous year. Consequently, the designation “Dedekind–Peano axioms” acknowledges both contributions. Peano’s original starting number was 1; he later adopted a formulation including 0. Choosing either starting convention does not alter the essential successor structure. (mathshistory.st-andrews.ac.uk)

The basic postulates

A common modern presentation uses a domain $N$, an element $0$, and a function $S:N\to N$, called the successor function. Informally, $S(n)$ means the number immediately following $n$. The postulates can be stated as follows:

1. $0$ is a natural number.

2. Every natural number has a successor that is also a natural number.

3. Zero is not the successor of any natural number:

   $$\forall n\in N,\quad S(n)\ne 0.$$

4. The successor function is injective:

   $$S(m)=S(n)\Longrightarrow m=n.$$

5. Every subset $X\subseteq N$ containing zero and closed under succession equals $N$:

   $$\bigl(0\in X\ \land\ \forall n\in N\,(n\in X\Rightarrow S(n)\in X)\bigr) \Longrightarrow X=N.$$

The fifth postulate is the principle of mathematical induction. When the domain and the function’s type are specified in advance, the first two conditions are incorporated into the setup rather than written as separate logical sentences. (mathshistory.st-andrews.ac.uk)

Numerals are then introduced by successive application of $S$:

The successor conditions distinguish these elements; full induction rules out any additional elements outside the sequence generated from zero. Thus, induction is not merely a technique for proof: it is also a structural requirement governing the entire domain. (pages.jh.edu)

Arithmetic operations

Addition and multiplication can be introduced through recursive equations:

In a suitable mathematical setting, recursion establishes the existence and uniqueness of these operations on the successor structure. In first-order arithmetic, the operation symbols are normally included in the language and these equations are axioms. (pages.jh.edu)

For example, the addition equations give

Induction supports proofs of familiar laws such as associativity and commutativity. An order relation can also be defined by

so that strict inequality expresses a positive additive difference. These constructions connect the successor postulates with ordinary calculations and number theory. (ocw.mit.edu)

First-order Peano arithmetic

Peano arithmetic, usually abbreviated PA, is commonly formulated in first-order logic with equality and symbols $0,S,+,\cdot$. Its variables range over individual numbers, not arbitrary subsets. The induction postulate therefore becomes an axiom schema: for every formula $\varphi(x,\bar y)$ in the arithmetic language, PA contains

The additional variables $\bar y$ allow parameters. This is an infinite family of axioms, although its instances are mechanically recognizable. (math.berkeley.edu)

The distinction is substantive: first-order induction applies to properties expressible by formulas, whereas full second-order induction applies to every subset of the domain. PA is consequently weaker than the full second-order characterization, despite proving a substantial body of elementary arithmetic. (math.berkeley.edu)

Categoricity and nonstandard models

In second-order logic with full semantics, subset variables range over the entire power set of the domain. The Peano axioms are then categorical: every model is isomorphic to the usual natural-number structure. An isomorphism preserves zero and succession, and hence recursively defined arithmetic operations. This result depends on full semantics; restricting the available subsets can invalidate categoricity. (pages.jh.edu)

First-order PA, by contrast, has nonstandard models. The compactness theorem explains their existence: introduce a constant $c$ and require $c$ to exceed each standard numeral. Every finite collection of these requirements is satisfiable in ordinary arithmetic, so the complete collection has a model. Its interpretation of $c$ exceeds every standard numeral, although it remains an element of the model’s number domain—not an ordinary natural number or an added “infinity.” These structures are central objects of model theory. (ocw.mit.edu)

Incompleteness and consistency

As an effectively axiomatized formal system, PA falls under Gödel’s incompleteness theorems. If PA is consistent, there are arithmetic sentences it neither proves nor refutes. Moreover, it cannot prove its own consistency expressed by the usual arithmetical consistency statement. These results concern formal derivability, not whether particular calculations have definite answers. (sciencedirect.com)

There is no conflict with second-order categoricity. Categoricity concerns which structures satisfy axioms; incompleteness concerns what an effective deductive system can prove. Full second-order logical consequence has no sound, complete, effective proof calculus. The distinction between semantic characterization and formal derivation is therefore essential when using Peano axioms in the foundations of mathematics. (plato.stanford.edu)