PA
(PA) is the restriction of Peano’s axioms to a first order theory of . The only change is that the induction axiom is replaced by induction restricted to arithmetic formulas:
Note that this replaces the single, second-order, axiom of induction with a countably infinite schema of axioms.
Appropriate axioms defining , , and are included. A full list of the axioms of PA looks like this (although the exact list of axioms varies somewhat from source to source):
-
•
( is the first number)
-
•
(the successor function is one-to-one)
-
•
( is the additive identity)
-
•
(addition is the repeated application of the successor function)
-
•
-
•
(multiplication is repeated addition)
-
•
( is the smallest number)
-
•
-
•
Title | PA |
---|---|
Canonical name | PA |
Date of creation | 2013-03-22 12:56:36 |
Last modified on | 2013-03-22 12:56:36 |
Owner | Henry (455) |
Last modified by | Henry (455) |
Numerical id | 10 |
Author | Henry (455) |
Entry type | Definition |
Classification | msc 03F30 |
Synonym | Peano arithmetic |
Synonym | first order Peano arithmetic |
Related topic | PeanoArithmetic |