A structured visual guide to the major mathematical areas and their relationships.
Search by code, branch, topic, subtopic, or a keyword from the descriptions.
This subtopic focuses on proof theory and constructive mathematics, analyzing the structure, strength, and computational content of proofs. It is used to study normalization, consistency, and formal systems for constructive reasoning. Applications include automated proof systems, certified computation, type theory, and foundational work where explicit constructive methods and proof complexity are central.
This topic covers proof theory in general, especially formal proof systems, sequent calculi, and the structural analysis of derivations. It sets the stage for specialized proof-theoretic techniques.
Used to analyse the internal structure of proofs and the strength of formal systems.
This topic covers cut-elimination and normal-form theorems, which remove detours from proofs and show how derivations can be simplified. These results reveal the internal computational content of logic.
Cut-elimination theorem (Wikipedia)
Used to prove consistency, extract computational content, and simplify proof structure.
This topic covers the structure of proofs, including how assumptions, lemmas, and sub-derivations are organized. It is a more meta-level view of proof theory and mathematical reasoning.
Mathematical proof (Wikipedia)
Used to analyse how proofs are built and which steps are essential or redundant.
This topic covers functionals in proof theory, especially higher-type functionals and their role in extracting computational information from proofs. It connects proof theory to computation and constructive mathematics.
Functional programming (Wikipedia)
Used to understand how proofs can generate algorithms or higher-order computational content.
This topic covers recursive ordinals and ordinal notations, which represent countable ordinals by effective systems. They are essential in proof theory and transfinite recursion.
Used to measure proof-theoretic strength and to control transfinite constructions effectively.
This topic covers complexity of proofs, asking how long or how complicated proofs must be in a given formal system. It complements decidability with a quantitative view of proof search.
Used to measure the difficulty of proving statements and to compare proof systems by efficiency.
This topic covers relative consistency and interpretations, which compare theories by showing one can be modeled inside another. It is one of the core metamathematical tools for foundations.
Relative consistency (Wikipedia)
Used to transfer consistency from known theories to new ones and to compare formal systems by strength.
This topic covers second- and higher-order arithmetic, systems that extend first-order arithmetic by allowing quantification over sets or functions. They are a major arena for proof theory and reverse mathematics.
Second-order arithmetic (Wikipedia)
Used to calibrate the strength needed for theorems in analysis and combinatorics.
This topic covers metamathematics of constructive systems, including intuitionistic and type-theoretic foundations. It studies what can be proved constructively and how such proofs behave computationally.
Constructive mathematics (Wikipedia)
Used to analyse constructive formal systems and to study proof extraction from constructive arguments.
This topic covers intuitionistic mathematics, which rejects nonconstructive principles such as excluded middle in their full classical form. It provides the philosophical and technical basis of many constructive systems.
Used to formulate mathematics in a way that emphasizes constructive proof and computational content.
This topic covers constructive and recursive analysis, where analysis is developed with explicit computational content and constructive existence. It is a natural meeting point of analysis, logic, and computation.
Constructive analysis (Wikipedia)
Used to study analysis with explicit constructions and algorithmic witnesses.
This topic covers other constructive mathematics, gathering constructive results and methods that do not fit the more specific proof-theoretic categories. It keeps track of the broader constructive programme.
Constructive mathematics (Wikipedia)
Used as a general home for constructive results across algebra, analysis, and logic.