Peano axioms

related topics
{math, number, function}
{theory, work, human}

In mathematical logic, the Peano axioms, also known as the Dedekind–Peano axioms or the Peano postulates, are a set of axioms for the natural numbers presented by the 19th century Italian mathematician Giuseppe Peano. These axioms have been used nearly unchanged in a number of metamathematical investigations, including research into fundamental questions of consistency and completeness of number theory.

The need for formalism in arithmetic was not well appreciated until the work of Hermann Grassmann, who showed in the 1860s that many facts in arithmetic could be derived from more basic facts about the successor operation and induction.[1] In 1881, Charles Sanders Peirce provided an axiomatization of natural-number arithmetic.[2] In 1888, Richard Dedekind proposed a collection of axioms about the numbers, and in 1889 Peano published a more precisely formulated version of them as a collection of axioms in his book, The principles of arithmetic presented by a new method (Latin: Arithmetices principia, nova methodo exposita).

The Peano axioms contain three types of statements. The first axiom asserts the existence of a least one member of the set "number". The next four are general statements about equality; in modern treatments these are often considered axioms of the "underlying logic" [3]. The next four axioms are first-order statements about natural numbers expressing the fundamental properties of the successor operation. The ninth, final axiom is a second order statement of the principle of mathematical induction over the natural numbers. A weaker first-order system called Peano arithmetic is obtained by explicitly adding the addition and multiplication operation symbols and replacing the second-order induction axiom with a first-order axiom schema.

Contents

Full article ▸

related documents
Limit superior and limit inferior
Matrix multiplication
Naive set theory
Zermelo–Fraenkel set theory
Inverse function
Finite field
Computational complexity theory
Recursion
Word problem for groups
Markov chain
Cantor set
Topological space
Collatz conjecture
Inner product space
Addition
Recurrence relation
Hash table
Pythagorean theorem
Binary search tree
Wavelet
Mathematical induction
Pi
Elliptic curve cryptography
Bra-ket notation
Groupoid
Cauchy sequence
LR parser
Limit (category theory)
Forcing (mathematics)
Johnston diagram