How does proof theory differ from model theory?

Model theory studies structures and the truth of sentences in them, a semantic perspective, whereas proof theory studies formal derivations and their syntactic transformations. Goedel's completeness theorem links the two, but their methods and questions are distinct.

What is Hilbert's programme?

It was the proposal to prove the consistency of all of mathematics using only finitary, uncontroversial reasoning. Goedel's second incompleteness theorem showed no sufficiently strong theory can prove its own consistency, so the programme cannot be carried out in its original form, though modified versions remain influential.

Proof Theory

Proof theory studies formal proofs as mathematical objects in their own right, analyzing their structure, transformations, and the strength of the theories that produce them.

Definition

Proof theory is the branch of mathematical logic that treats proofs in formal systems as finite combinatorial objects, studying how they can be transformed and normalized and what their existence reveals about the consistency and strength of the underlying theories.

Scope

This area covers formal calculi such as natural deduction and the sequent calculus, the cut-elimination and normalization theorems, Goedel's incompleteness theorems, the measurement of the strength of theories by ordinal analysis, and the constructive and computational content of proofs revealed by the correspondence between proofs and programs.

Sub-topics

Core questions

How can formal proofs be represented and manipulated as combinatorial objects?
Which detours in proofs can be systematically removed, and what does that reveal?
What are the inherent limits on what a formal theory can prove about itself?
How can the strength of a theory be measured precisely?

Key theories

Cut-elimination theorem: Gentzen showed that any proof in the sequent calculus can be transformed into one without the cut rule, yielding proofs with the subformula property and direct consistency results.
Goedel incompleteness theorems: Any consistent formal theory strong enough to express arithmetic contains true sentences it cannot prove and cannot prove its own consistency, fixing fundamental limits on formalization.
Curry-Howard correspondence: Proofs in natural deduction correspond to terms of a typed lambda calculus and proof normalization corresponds to computation, linking proof theory to the theory of programming languages.

Clinical relevance

Proof theory underlies the analysis of consistency and constructive content in mathematics and supplies the theoretical basis for type theory, functional programming, and automated proof assistants, where proofs double as verifiable programs.

History

Proof theory was founded by Hilbert as part of his programme to secure mathematics by finitary consistency proofs. Goedel's incompleteness theorems of 1931 showed the original programme could not fully succeed, and Gentzen's cut-elimination and consistency proof for arithmetic via transfinite induction redirected the field toward ordinal analysis and, later, the proofs-as-programs paradigm.

Key figures

David Hilbert
Gerhard Gentzen
Kurt Goedel
Jean-Yves Girard

Seminal works

troelstra2000
takeuti1987
girard1989

Frequently asked questions

How does proof theory differ from model theory?: Model theory studies structures and the truth of sentences in them, a semantic perspective, whereas proof theory studies formal derivations and their syntactic transformations. Goedel's completeness theorem links the two, but their methods and questions are distinct.
What is Hilbert's programme?: It was the proposal to prove the consistency of all of mathematics using only finitary, uncontroversial reasoning. Goedel's second incompleteness theorem showed no sufficiently strong theory can prove its own consistency, so the programme cannot be carried out in its original form, though modified versions remain influential.