second-order arithmetic

second-order arithmetic is a formal system in mathematical logic that extends first-order logic by including variables that range over sets of natural numbers as well as variables that range over natural numbers themselves. It provides a framework for formalizing a large portion of classical analysis, portions of number theory, and parts of combinatorics within a single unified language. Central to its study are connections to models, proof-theoretic strength, and computability, with interactions across work by figures such as Kurt Gödel, Alan Turing, and Gerhard Gentzen.

Definition and language

The language of second-order arithmetic builds on the language of Peano arithmetic by adding second-order variables for subsets of the natural numbers and a membership predicate linking number variables and set variables; combinatorial principles and arithmetical hierarchies are expressed using this language with reference to systems like Zermelo–Fraenkel set theory and axioms studied by David Hilbert and Alfred Tarski. Formulas separate first-order quantifiers over elements of the standard model of N from second-order quantifiers over subsets, permitting statements about recursive sets studied by Emil Post as well as definable families considered by Solomon Feferman. Choice of comprehension and induction schemata leads to systems such as those investigated in programs influenced by John Myhill and Harvey Friedman; these axioms are often calibrated against principles named after institutions like the Institute for Advanced Study to measure strength relative to fragments of Zermelo set theory and predicative systems discussed by W. V. O. Quine.

Models and semantics

Models of second-order arithmetic are often presented as two-sorted structures with a first sort for natural numbers and a second sort for families of naturals; canonical examples include the standard model of N with full power set versus countable models associated to recursive sets studied by Stephen Kleene and Alan Turing. The distinction between full and Henkin semantics mirrors debates in the work of Alfred Tarski and Kurt Gödel on semantics and completeness: full second-order semantics lack a complete proof system akin to Gödel's completeness theorem for first-order logic, while Henkin-style semantics yield completeness theorems analogous to results by Leon Henkin and model-construction techniques employed by Saharon Shelah. Admissible sets and inner models related to Paul Cohen's forcing method and investigations by Dana Scott provide terrain for nonstandard models and ω-models studied in the context of recursion theory and work by Harvey Friedman.

Subsystems and reverse mathematics

Subsystems of second-order arithmetic, such as RCA_0, WKL_0, ACA_0, ATR_0, and Π^1_1-CA_0, were organized in the program of reverse mathematics chiefly developed by Harvey Friedman and Stephen Simpson with influences from Gerald Sacks and Michael O. Rabin. RCA_0 formalizes computable mathematics linked to results of Alonzo Church and Emil Post; WKL_0 encapsulates compactness principles related to the Heine–Borel theorem and the Bolzano–Weierstrass theorem investigated by Bernhard Riemann and Karl Weierstrass; ACA_0 corresponds to arithmetical comprehension reflecting themes in David Hilbert's program and Kurt Gödel's analyses; ATR_0 and Π^1_1-CA_0 capture transfinite recursion and comprehension connected to work by William Rowan Hamilton and investigations by John von Neumann into ordinal analysis. Each subsystem is linked with specific mathematical theorems and combinatorial principles whose equivalence or non-equivalence is established by methods associated with Paul Erdős, András Hajnal, and contributors in combinatorial set theory.

Proof theory and computability

Proof-theoretic strength of second-order arithmetic subsystems is measured using ordinal analysis building on methods by Gerhard Gentzen and later refinements by Wilfried Buchholz and Jean-Yves Girard, tying consistency and derivability to ordinals named in the literature and to canonical systems like Peano arithmetic. Computability-theoretic aspects relate to degrees of unsolvability and Turing degrees developed by Alan Turing and Emil Post; Δ^0_n, Σ^0_n, and Π^0_n hierarchies within models reflect recursion-theoretic classifications studied by Stephen Kleene and Richard Shore. Conservation results and proof transformations exploit techniques from the work of Douglas Hofstadter's citations of recursive function theory and structural proof theory methods influenced by William Tait and Georg Kreisel.

Historical development and applications

Historically, second-order arithmetic emerged from early 20th-century foundational debates involving David Hilbert's program, Kurt Gödel's incompleteness results, and developments in set theory by Ernst Zermelo and Abraham Fraenkel; subsequent formalization and subsystem classification were advanced by Harvey Friedman, Stephen Simpson, and others during the late 20th century. Applications span formalizing classical results in real analysis traced to Augustin-Louis Cauchy and Karl Weierstrass, formal studies of combinatorial principles initiated by Paul Erdős and Ronald Graham, and connections to computational complexity and computable analysis studied by Anil Nerode and Ker-I Ko. Ongoing research relates second-order arithmetic to areas influenced by Per Martin-Löf's type theory, large cardinal considerations from Solomon Feferman and John Steel, and algorithmic randomness as explored by Gregory Chaitin and Claude Shannon.

Category:Mathematical logic