Mathematical logic and foundations Arithmetic and incompleteness Concept
Peano axioms
Summary
The Peano axioms are axioms for the natural numbers. They use a set , an element of and a function , the successor function. The axioms state three properties of these data. First, for each in . Second, is injective: if , then . Third, the induction axiom holds: if a subset of contains and contains for each in , then .
Remarks
Giuseppe Peano published the axioms in 1889. Richard Dedekind gave a similar system in 1888. The induction axiom speaks about all subsets of , 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.
- Well-ordering principle
- Successor function
- Associativity of addition
- Zero is not a successor
- Commutativity of addition
- Induction from an arbitrary base case
- Multiplication of natural numbers
- Distributive law
- Strong induction
- The successor function is injective
- Addition of natural numbers
- Order on the natural numbers
- Non-standard model of arithmetic
- Löb's theorem
- Realizability
- Paris–Harrington theorem
- Ordinal analysis
- Provability logic
- Presburger arithmetic
- Proof-theoretic ordinal
- Ordinal analysis
- Proof-theoretic ordinal
- Heyting arithmetic
- Realizability
- Double-negation translation
- Dialectica interpretation
- Hilbert's program
- Double-negation translation
- Gentzen's consistency proof
- Heyting arithmetic
- Robinson arithmetic
- Tennenbaum's theorem
- Gödel's incompleteness theorems
- Goodstein's theorem
- Second-order arithmetic
- Dialectica interpretation
Further reading
- Web https://en.wikipedia.org/wiki/Peano_axioms, Historical second-order formulation
About this page
| Tag | 0QFT7Z76N5 |
|---|---|
| URI | m2://0QFT7Z76N5 |
| Aliases | dedekind-peano-axioms, peano-postulates |
| Kind | concept |
| Writing | W1 stated |
| MSC | 03F30 |
| 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
- Successor function
- Zero is not a successor
- The successor function is injective
- Non-standard model of arithmetic
- Löb's theorem
- Paris–Harrington theorem
- Ordinal analysis
- Provability logic
- Presburger arithmetic
- Proof-theoretic ordinal
- Ordinal analysis
- Proof-theoretic ordinal
- Heyting arithmetic
- Double-negation translation
- Hilbert's program
- Double-negation translation
- Gentzen's consistency proof
- Heyting arithmetic
- Robinson arithmetic
- Tennenbaum's theorem
- Gödel's incompleteness theorems
- Goodstein's theorem
- Second-order arithmetic