Peano arithmetic — LLMpedia

Peano arithmetic
Name	Peano arithmetic
Caption	Giuseppe Peano
Field	Mathematical logic
Introduced	1889
Notable	Peano axioms, Robinson arithmetic

Contents

Peano arithmetic is a first-order axiomatization of the natural numbers introduced by Giuseppe Peano and developed in the context of late 19th-century formalism by contributors associated with institutions such as the University of Turin and the Kurt Gödel Research Center. It provides a foundation for elementary number theory used in work by mathematicians and logicians including David Hilbert, Bertrand Russell, Alfred North Whitehead, Ernst Zermelo, and Leopold Kronecker. The system influenced research at places like the University of Göttingen, the Institute for Advanced Study, and the Princeton University mathematics department.

Definition

Peano arithmetic is defined as a first-order theory formulated in the language with symbols for zero, successor, addition, multiplication, and equality; it builds on logical frameworks from figures such as Gottlob Frege, Gottfried Wilhelm Leibniz, and George Boole. The definition uses axioms inspired by work at the École Normale Supérieure, the University of Cambridge, and the Collège de France, and interacts with theories like Zermelo–Fraenkel set theory, Type theory, and Category theory. Formal treatments appear in texts by Bertrand Russell, Alfred Tarski, Emil Post, and Alonzo Church, and are taught in curricula at the Massachusetts Institute of Technology, Harvard University, and University of Oxford.

The axioms were first presented by Giuseppe Peano and later analyzed by logicians including David Hilbert, Kurt Gödel, Gerhard Gentzen, C.C. Chang, and H. Jerome Keisler. The usual axioms assert that zero is not the successor of any number, distinct successors are unequal, and induction holds for all formulas; formal proofs appear in works by John von Neumann, Paul Bernays, Abraham Robinson, and Thoralf Skolem. Meta-theorems about these axioms were proved by Kurt Gödel, Alfred Tarski, Wilhelm Ackermann, and Stephen Kleene with techniques from model theory, proof theory, and recursion theory.

Studies of models and nonstandard models were advanced by pioneers at institutions such as the University of Vienna, the University of Chicago, and the University of Warsaw by researchers including Thoralf Skolem, Abraham Robinson, Jerzy Łoś, Alfred Tarski, and Dana Scott. Nonstandard models exhibit elements termed "nonstandard integers" analogous to constructions in Abraham Robinson's nonstandard analysis; methods draw on compactness and Löwenheim–Skolem techniques developed by Leopold Löwenheim, Thoralf Skolem, and Kurt Gödel. Classification results connect to work by Alfred Tarski, Saharon Shelah, Michael Morley, and Akihiro Kanamori.

Formal definitions of addition and multiplication follow recursive patterns used by Giuseppe Peano and were elaborated in treatises by Ernst Zermelo, John von Neumann, Richard Dedekind, and Georg Cantor. Standard theorems—such as associativity, commutativity, distributivity, Euclidean algorithm results, and unique factorization—were formalized in frameworks employed by Carl Friedrich Gauss, Euclid, Pierre de Fermat, Leonhard Euler, and Adrien-Marie Legendre. Proof-theoretic analysis of these theorems involves methods by Gerhard Gentzen, William Tait, Solomon Feferman, and Sydney Cole Kleene and connects to complexity results studied by Stephen Cook, László Babai, and Richard J. Lipton.

Metamathematical properties were illuminated by Kurt Gödel's incompleteness theorems, with subsequent refinements by Alfred Tarski, Paul Cohen, Gerhard Gentzen, Dana Scott, and Hilbert's program critics such as W. V. O. Quine. Gödel numbering and representability lemmas echo techniques from Emil Post, Alonzo Church, Noam Chomsky, and Stephen Kleene; independence results connect with forcing methods by Paul Cohen and consistency investigations by Alan Turing, John von Neumann, and Gerald Sacks. Applications link to studies by Per Martin-Löf, Arend Heyting, Michael Rathjen, and Wilfrid Hodges.

Extensions and variants include second-order formulations studied by Dedekind and formalized in work by Haskell Curry, Alonzo Church, Per Martin-Löf, and Bertrand Russell; weak fragments like Robinson arithmetic were analyzed by R. M. Robinson, Samuel Eilenberg, and Mac Lane in categorical contexts. Other variants include constructive systems championed by Luitzen Brouwer, Arend Heyting, and Andrei Kolmogorov, and systems with additional axioms studied by Paul Cohen, Saharon Shelah, and W. Hugh Woodin. Connections exist with computational paradigms explored by Stephen Cook, Leslie Valiant, Leslie Lamport, Dana Scott, and Robin Gandy.