Math 2.0

Mathematical logic and foundations Arithmetic and incompleteness Concept

Peano axioms

Summary

The Peano axioms are axioms for the natural numbers. They use a set ℕ\mathbb{N}, an element 00 of ℕ\mathbb{N} and a function S ⁣:ℕ→ℕS \colon \mathbb{N} \to \mathbb{N}, the successor function. The axioms state three properties of these data. First, S(n)≠0S(n) \neq 0 for each nn in ℕ\mathbb{N}. Second, SS is injective: if S(m)=S(n)S(m) = S(n), then m=nm = n. Third, the induction axiom holds: if a subset AA of ℕ\mathbb{N} contains 00 and contains S(n)S(n) for each nn in AA, then A=ℕA = \mathbb{N}.

Remarks

Giuseppe Peano published the axioms in 1889. Richard Dedekind gave a similar system in 1888. The induction axiom speaks about all subsets of ℕ\mathbb{N}, thus it is a second-order axiom. First-order Peano arithmetic replaces it with an axiom schema. The axioms are the base for the principle of mathematical induction and for definition by recursion.

Where this leads

36 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Peano_axioms, Historical second-order formulation
About this page
Tag0QFT7Z76N5
URIm2://0QFT7Z76N5
Aliasesdedekind-peano-axioms, peano-postulates
Kindconcept
WritingW1 stated
MSC03F30
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by

Results about this