Peano arithmetic
Peano’s axioms are a definition of the set of natural numbers, denoted ℕ. From these axioms Peano arithmetic on natural numbers
can be derived.
-
1.
0∈ℕ (0 is a natural number)
-
2.
For each x∈ℕ, there exists exactly one x′∈ℕ, called the successor
of x
-
3.
x′≠0 (0 is not the successor of any natural number)
-
4.
x=y if and only if x′=y′.
-
5.
(axiom of induction) If M⊆ℕ and 0∈M and x∈M implies x′∈M, then M=ℕ.
The successor of x is sometimes denoted Sx instead of x′. We then have 1=S0, 2=S1=SS0, and so on.
Peano arithmetic consists of statements derived via these axioms. For instance, from these axioms we can define addition and multiplication on natural numbers.
Addition is defined as
x+1 | = | x′ for all x∈ℕ | ||
x+y′ | = | (x+y)′ for all x,y∈ℕ |
Addition defined in this manner can then be proven to be both associative and commutative.
Multiplication is
x⋅1 | = | x for all x∈ℕ | ||
x⋅y′ | = | x⋅y+x for all x,y∈ℕ |
This definition of multiplication can also be proven to be both associative and commutative, and it can also be shown to be distributive over addition.
Title | Peano arithmetic |
Canonical name | PeanoArithmetic |
Date of creation | 2013-03-22 12:32:42 |
Last modified on | 2013-03-22 12:32:42 |
Owner | alozano (2414) |
Last modified by | alozano (2414) |
Numerical id | 8 |
Author | alozano (2414) |
Entry type | Axiom |
Classification | msc 03F30 |
Related topic | NaturalNumber |
Related topic | PressburgerArithmetic |
Related topic | ElementaryFunctionalArithmetic |
Related topic | PeanoArithmeticFirstOrder |
Defines | Peano’s axioms |
Defines | successor |
Defines | axiom of induction |