Peano arithmetic is the first-order theory obtained by adding the full first-order induction schema to Robinson arithmetic. For each arithmetic first-order formula , include the universal closure in its parameter variables ofThe schema supplies one axiom for every formula; it does not quantify over arbitrary subsets of the universe. The order relation can be added by a defining axiom such as .
For example, induction on proves , complementing the axiom . Despite its intended interpretation in the natural numbers, Peano arithmetic also has non-standard models of arithmetic by the compactness theorem. First-order induction reaches every definable subset satisfying its hypotheses, without making the theory categorical.[ref]
Introduction to the Theory of Computation: Computability, Complexity, and the Lambda Calculus by Jean Gallier and Jocelyn Quaintance (2020). Chapter6, printed p.156, induction schema
New to topics? Read the docs here!