Peano arithmetic (original) (raw)

    1. 0∈ℕ (0 is a natural number)
    1. For each x∈ℕ, there exists exactly one x′∈ℕ, called the successorMathworldPlanetmathPlanetmath of x
    1. x′≠0 (0 is not the successor of any natural number)
    1. x=y if and only if x′=y′.

The successor of x is sometimes denoted S⁢x instead of x′. We then have 1=S⁢0, 2=S⁢1=S⁢S⁢0, and so on.

Peano arithmetic consists of statements derived via these axioms. For instance, from these axioms we can define additionPlanetmathPlanetmath 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 commutativePlanetmathPlanetmathPlanetmath.

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