- Atlas
- Mathematics
- Constructive Mathematics
Constructive Mathematics
Constructive mathematics is the part of mathematics that treats existence as something you must exhibit.
9 frameworks, from 1907 to today · Mathematical Logic · Mathematics
Overview
Constructive mathematics is the part of mathematics that treats existence as something you must exhibit12. To prove that a number with a certain property exists, a constructive proof must show how to find it; to prove that either A or B holds, it must show which one, or give a procedure that decides12. This sounds like a mild scruple, but it changes what counts as a proof, and it has repeatedly forced mathematicians to rebuild familiar subjects—analysis, algebra, set theory—on new foundations. The history of the field is a history of arguments about what mathematical existence means, and of the surprising amount of ordinary mathematics that turns out to survive when the scruple is taken seriously.
Brouwer and the intuitionist revolt
The founding moment is the work of L. E. J. Brouwer, a Dutch topologist who around 1907–1912 turned against the classical mathematics of his teachers. The target was the unrestricted use of the law of excluded middle—the principle that every statement is either true or false—and of actual infinity12. Classical arguments often prove that something exists by showing that its non-existence leads to contradiction; Brouwer held that such a proof establishes nothing you can grasp, because it gives no construction.
His positive doctrine, intuitionism, held that mathematics is a free activity of the mind building up objects from the basic intuition of time, in which one moment is followed by another. From this came a distinctive theory of the continuum: the real numbers are not a completed totality but a growing sequence of choices, and Brouwer developed choice sequences—sequences whose terms are not fixed in advance but are chosen step by step, subject only to a rule the mathematician may impose. On this basis he proved results that are false classically, most famously the continuity theorem: every function from the reals to the reals is continuous. In classical mathematics this is plainly false (a step function is a counterexample), which shows how far intuitionism departs from the classical picture.
Brouwer's programme was radical and isolating. He rejected much of set theory and even parts of classical logic, and a bitter dispute with Hilbert in the 1920s—Hilbert thought Brouwer's restrictions would mutilate mathematics—left intuitionism a minority position. But it produced a precise logic.
Heyting and the logic of constructions
Brouwer was suspicious of formal logic, but his student Arend Heyting formalised the reasoning intuitionists accept. In the 1920s and 1930s Heyting set out intuitionistic logic, in which the connectives are read as statements about proofs: a proof of "A and B" is a pair of proofs, a proof of "A or B" is a proof of one of them together with which one, and a proof of "A implies B" is a method converting any proof of A into a proof of B. Excluded middle is not an axiom, because there is no general method that, given any statement, produces a proof of it or of its negation.
The decisive result came from Gerhard Gentzen in 1935. His natural deduction and sequent calculus gave intuitionistic logic a clean proof-theoretic form, and his cut-elimination theorem showed that proofs in these systems can be normalised. This made intuitionistic logic a technical object of study in its own right, and it revealed a structure—the Brouwer–Heyting–Kolmogorov interpretation of proofs as constructions—that would later become central to computer science.
Realizability and the metamathematics of constructions
A second strand made constructive reasoning an object of ordinary mathematics. In 1945 Stephen Kleene, working in recursion theory, introduced realizability: a number realizes a formula if it encodes a computation witnessing it, so that "p realizes A implies B" means p is a code for a procedure turning any realizer of A into one of B. This gave a precise, classical metatheory in which one can prove that intuitionistic arithmetic is consistent and that its theorems have computational content. Kleene's work, and later realizability models over arbitrary structures, became a standard tool: it shows that a constructive proof can be read as a program.
Bishop's constructive analysis
The most influential turning point for working mathematicians came in 1967, when Errett Bishop published Foundations of Constructive Analysis13. Bishop was not a Brouwerian: he avoided choice sequences and the more speculative parts of intuitionism, and he set out to show that a large body of ordinary analysis—integration, measure theory, functional analysis—could be developed constructively with familiar-looking proofs. His book proved that constructive mathematics need not be a fragment; it could be a parallel, fully developed subject.
Bishop's approach, often called Bishop constructivism, relies on careful definitions: a real number is a Cauchy sequence with a known modulus of convergence, a set is given with an equality relation, and every existence claim carries a construction. The cost is real—some classical theorems fail or need reformulation—but the gain is that every theorem has computational meaning. Bishop's school, continued by his student Douglas Bridges and others, established constructive analysis as a recognised field.
Topos theory and the categorical turn
In the 1960s and 1970s, category theory gave constructive logic a new home. William Lawvere and Myles Tierney developed elementary topos theory, and it was recognised that the internal logic of a topos is intuitionistic. A topos is a category with enough structure to behave like the category of sets, but its internal language need not validate excluded middle4. This gave a geometric and algebraic semantics for intuitionistic logic, and it connected constructive mathematics to algebraic geometry (Grothendieck topoi) and to the foundations of set theory. The insight that a "universe of sets" can have intuitionistic logic built in reframed constructivity as a structural, not merely philosophical, matter.
Type theory: Martin-Löf and beyond
A parallel foundation grew from logic and computer science. In the 1970s Per Martin-Löf developed intuitionistic type theory, in which the basic objects are types and terms, and a proposition is identified with the type of its proofs—the propositions-as-types principle, closely related to the Curry–Howard correspondence15. Martin-Löf's systems went through several versions; the intensional version, with its distinction between definitional and propositional equality, became the standard. Type theory made constructive reasoning directly computational: a proof term is a program, and normalisation of terms is computation.
This line of work fed into constructive set theory, developed from the 1970s onward by John Myhill, Harvey Friedman, and others, which axiomatises sets in a way compatible with intuitionistic logic (for example, without excluded middle or with restricted separation), providing a set-theoretic home for Bishop-style mathematics. It also fed into computer science: type theories became the basis of proof assistants and dependently typed programming languages.
Homotopy type theory
The most recent major development is homotopy type theory, which emerged around 2006–2013 from the observation, due to Vladimir Voevodsky and others, that Martin-Löf's identity types can be interpreted as paths in a space. Under this reading, a type is a space, a term is a point, and an equality proof is a path; types themselves have higher structure. This led to the univalence axiom, asserting that equivalent types are identical, and to a new foundation for mathematics in which homotopy-theoretic ideas are built in. The 2013 book Homotopy Type Theory: Univalent Foundations of Mathematics, written collaboratively, consolidated the field. It is an active research area connecting constructive foundations, algebraic topology, and computer-checked mathematics.
Proof mining and the present
Alongside these foundations, a methodological tradition grew up around extracting computational content from ordinary, often classical, proofs. Proof mining, developed especially by Ulrich Kohlenbach from the 1990s, applies proof-theoretic transformations—variants of Gödel's Dialectica interpretation and related functional interpretations—to concrete classical proofs in analysis, producing explicit bounds and effective results that were not visible in the original argument. It is constructive mathematics used as a tool on non-constructive mathematics.
Today the field is plural. Bishop-style constructive analysis continues through the work of Bridges and others; intuitionistic logic and type theory are standard equipment in proof assistants such as Coq and Agda; topos theory provides semantics and connects to geometry; homotopy type theory is a lively frontier; and realizability and functional interpretations remain central to proof theory. The open questions are both foundational—which type theories best capture mathematical practice, how univalence should be integrated with computation—and practical, as constructive methods are increasingly used to certify software and to extract algorithms from proofs. What unites the field is still Brouwer's original demand: that a proof of existence be a way of finding.
References
- Constructivism (philosophy of mathematics) (introduction, Constructive mathematics, The place of constructivism in mathematics, Mathematicians who have made major contributions to constructivism), Wikipedia
- Constructive proof, Wikipedia
- Errett Bishop, Wikipedia
- Elementary topos, Wikipedia
- Intuitionistic type theory, Wikipedia
The frameworks of Constructive Mathematics
Each framework is a way of working the field has used: when it held, and the question it answers.
- 1907-Present
- 1925-Present
- 1945-Present
- 1967-Present
- 1969-Present
- 1972-Present
- 1975-Present
- 1990-Present
- 2006-Present
How the ideas connect
Each arrow runs from an earlier idea to the later one it shaped. The list below says what passed between them.
Intuitionistic logic grew out of Intuitionism
Heyting, Brouwer's student, formalised the reasoning intuitionists accept, turning Brouwer's philosophical doctrine into a precise logic. The connectives were read as statements about proofs, and excluded middle was dropped because no general method decides it.
Carried by Arend Heyting.
Realizability influenced by Intuitionistic logic
Kleene's realizability gave intuitionistic logic a classical metatheory in which a number encodes a computation witnessing a formula. It made precise the Brouwer–Heyting–Kolmogorov reading of proofs as constructions.
Carried by Stephen Kleene.
Intuitionistic type theory influenced by Intuitionistic logic
Martin-Löf's type theory takes the intuitionistic reading of proofs as constructions and makes it the syntax of the system, with propositions identified with types of proofs. The Curry–Howard correspondence supplied the underlying principle.
Carried by Per Martin-Löf.
Homotopy type theory grew out of Intuitionistic type theory
Homotopy type theory grew from the observation that Martin-Löf's identity types can be read as paths in a space, giving types higher structure. Voevodsky and others built the univalence axiom on that reading of intensional type theory.
Carried by Vladimir Voevodsky; Homotopy Type Theory (2013).
Constructive analysis reacted against Intuitionism
Bishop deliberately avoided Brouwer's choice sequences and speculative continuum, keeping the constructive scruple but rejecting intuitionist metaphysics. He set out to rebuild ordinary analysis with familiar-looking proofs.
Carried by Errett Bishop; Foundations of Constructive Analysis (1967).
Constructive analysis influenced by Intuitionistic logic
Bishop's constructive analysis is carried out in intuitionistic logic, with existence claims requiring explicit constructions and disjunctions requiring a decision. The logic Heyting formalised supplies the reasoning he uses throughout.
Carried by Errett Bishop.
Elementary topos influenced by Intuitionistic logic
Elementary topos theory was built so that a topos has an internal language, and that language is intuitionistic logic. Lawvere and Tierney's work gave intuitionistic logic a categorical and geometric semantics.
Carried by William Lawvere; Myles Tierney.
Constructive set theory influenced by Intuitionistic logic
Constructive set theory is axiomatised in intuitionistic logic, dropping excluded middle and restricting separation accordingly. The logic Heyting formalised is the background logic of these systems.
Carried by John Myhill.
Intuitionistic type theory influenced by Realizability
The propositions-as-types reading in Martin-Löf's type theory is a syntactic form of the realizability idea that a proof is a construction witnessing a formula. Both make the computational content of a proof explicit.
Carried by Per Martin-Löf.
Proof mining influenced by Realizability
Proof mining applies functional interpretations, variants of Gödel's Dialectica, to extract bounds from classical proofs. These proof-theoretic transformations descend from the realizability tradition of reading proofs as computations.
Carried by Ulrich Kohlenbach.
Constructive set theory influenced by Constructive analysis
Constructive set theory was developed to provide a set-theoretic home for Bishop-style mathematics, axiomatising sets without excluded middle or with restricted separation. Myhill and Friedman built systems meant to formalise the analysis Bishop had done.
Carried by John Myhill; Harvey Friedman.
Beyond the field
Where Constructive Mathematics's ideas came from in other fields, and what they led to there: the strongest 12 of 47 links.
Intuitionism led to Intuitionistic and Constructive Analysis in Mathematical Analysis
Brouwer's intuitionist programme generated a constructive style of analysis, and later workers such as Heyting developed intuitionistic and constructive analysis as a branch of it.
Carried by L. E. J. Brouwer; Arend Heyting.
Intuitionism led to Intuitionistic logic in Logic
Intuitionistic logic descends from the constructive mathematics of Brouwer's school, whose refusal of excluded middle and of completed infinities it formalises. The logic is a branch of that constructive programme.
Carried by L. E. J. Brouwer; Arend Heyting.
Intuitionistic logic grew out of Intuitionism in Philosophy Of Mathematics
Heyting's formalisation was presented as the logic underlying Brouwer's philosophy of mathematics, making the calculus a direct outgrowth of intuitionism.
Carried by Arend Heyting; L. E. J. Brouwer.
Intuitionistic logic grew out of Intuitionism in Philosophical Logic
Heyting formalised intuitionistic logic expressly as the logic implicit in Brouwer's intuitionist mathematics, so the calculus is a branch grown out of the earlier programme.
Carried by Arend Heyting; L. E. J. Brouwer.
Intuitionistic logic grew out of Intuitionism in Foundations Of Mathematics
The intuitionist foundations programme produced intuitionistic logic as its formal logical core, so the logic derives from the earlier foundational doctrine.
Carried by Arend Heyting.
Intuitionistic logic grew out of Intuitionism in Philosophy Of Logic
Intuitionistic logic was constructed to make precise the philosophy-of-logic position of the intuitionists, deriving its rejection of excluded middle from Brouwer's views on construction.
Carried by Arend Heyting.
Realizability influenced by Computability Theory in Mathematical Logic
Realizability is defined in terms of recursive functions and their indices, so the mathematical theory of computability provided its central concept.
Carried by Stephen Cole Kleene.
Realizability influenced by Computability theory in Logic
Kleene built realizability on his own theory of computable functions, so that a realizer is a partial recursive function; computability theory supplied the machinery of the notion.
Carried by Stephen Cole Kleene.
Elementary topos led to Internal Language and Categorical Logic in Topos Theory
The internal language and categorical logic of toposes were built on the elementary topos axioms of Lawvere and Tierney, which supplied the structure whose internal logic is described. The elementary topos is the object whose language the theory formalises.
Carried by William Lawvere; Myles Tierney.
Elementary topos influenced by Topos in Category Theory
Lawvere and Tierney's elementary topos was an axiomatisation of Grothendieck's category-theoretic toposes, extracting their essential properties into elementary axioms.
Carried by William Lawvere; Myles Tierney; Alexander Grothendieck.
Elementary topos influenced by Sheaves, Sites, and Topos Theory in Categorical Algebra
The elementary topos was abstracted from the sheaf, site and topos theory developed in categorical algebra, whose constructions it took as its model.
Carried by Alexander Grothendieck; William Lawvere.
Elementary topos influenced by Grothendieck Toposes and Sites in Topos Theory
The elementary topos was obtained by axiomatising Grothendieck's toposes and sites, so the earlier sheaf-theoretic machinery passed directly into the new definition.
Carried by William Lawvere; Myles Tierney.

Constructive Mathematics is a planet in Nousfarer
Its city has a tower for each of these 9 frameworks. Land, walk in, and climb one concept at a time.
Land on Constructive MathematicsRelated fields
Fields its ideas are linked to
- Mathematical Logic 8 links
- Mathematical Analysis 6 links
- Foundations Of Mathematics 6 links
- Topos Theory 4 links
- Philosophy Of Mathematics 4 links
- Proof Theory 3 links
- Logic 3 links
- Philosophical Logic 3 links
- Real Analysis 2 links
- Categorical Algebra 1 link
- Recursion Theory 1 link
- Type Theory 1 link
More in Mathematical Logic
- Descriptive Set Theory
- Mathematical Logic
- Model Theory
- Proof Theory
- Recursion Theory
- Set Theory
- Type Theory
See where Constructive Mathematics sits on the Map of Human Knowledge