Back Bewysteorie Afrikaans نظرية البرهان Arabic প্রমাণ তত্ত্ব Bengali/Bangla Teoria de la demostració Catalan Beweistheorie German Pruvteorio Esperanto Teoría de la demostración Spanish نظریه برهان Persian Théorie de la démonstration French תורת ההוכחות HE
Proof theory is a major branch[1] of mathematical logic and theoretical computer science within which proofs are treated as formal mathematical objects, facilitating their analysis by mathematical techniques. Proofs are typically presented as inductively-defined data structures such as lists, boxed lists, or trees, which are constructed according to the axioms and rules of inference of a given logical system. Consequently, proof theory is syntactic in nature, in contrast to model theory, which is semantic in nature.
Some of the major areas of proof theory include structural proof theory, ordinal analysis, provability logic, reverse mathematics, proof mining, automated theorem proving, and proof complexity. Much research also focuses on applications in computer science, linguistics, and philosophy.
- ^ According to Wang (1981), pp. 3–4, proof theory is one of four domains mathematical logic, together with model theory, axiomatic set theory, and recursion theory. Barwise (1978) consists of four corresponding parts, with part D being about "Proof Theory and Constructive Mathematics".