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 develops model theory, the study of mathematical structures that satisfy formal languages and theories. It is used to compare theories via completeness, categoricity, and quantifier elimination, to classify structures, and to transfer ideas between logic and algebra. Applications include algebraic geometry, number theory, combinatorics, finite model theory, and computer science, where model-theoretic tools reveal deep structural behavior.
This topic covers equational classes and universal algebra, focusing on algebraic structures defined by identities and the general theory of varieties. It provides the algebraic side of model theory.
Used to study algebraic classes via equations, closure properties, and lattice-theoretic structure of varieties.
This topic covers basic properties of first-order languages, including syntax, signatures, terms, formulas, and interpretations. It lays the groundwork for all of first-order model theory.
Used to define formal languages for mathematical theories and to establish semantic conventions for model theory.
This topic covers quantifier elimination and model completeness, two central notions that simplify the structure of theories and make definability more transparent. They are major tools for determining the tame behaviour of models.
Quantifier elimination (Wikipedia)
Used to prove decidability, simplify definable sets, and analyse model-theoretic tameness in algebra and geometry.
This topic covers finite structures, where the model-theoretic behaviour of finite sets, graphs, and relational systems is studied with special attention to combinatorial and computational properties. It connects logic to finite model theory and complexity.
Finite model theory (Wikipedia)
Used to study databases, graphs, and finite combinatorial structures from a logical perspective.
This topic covers ultraproducts and related constructions, which combine families of structures into a single object using an ultrafilter. The construction is a key tool for transferring properties across models.
Used to build nonstandard models, prove compactness-style results, and compare families of structures.
This topic covers categoricity and completeness of theories, asking when a theory has a unique model of a given cardinality and when every sentence is decided by the theory. These are central measures of structural control.
Used to classify theories by rigidity and to understand when axioms determine a structure uniquely up to isomorphism.
This topic covers classification theory, stability, and related ideas that organize model theory into tame and wild regimes. Stability theory is a major framework for understanding definable structure.
Used to analyse the geometry of types and the structural behaviour of models in theories with controlled combinatorics.
This topic covers model-theoretic algebra, where algebraic structures are studied with logical tools such as types, definability, and elimination of quantifiers. It is an area where algebra and logic strongly interact.
Used to study algebraic structures via logical definability and tame geometry arguments.
This topic covers models of arithmetic and set theory, focusing on how logical tools analyse the standard and nonstandard models of foundational theories. It is central to the interaction between model theory and foundations.
Nonstandard model of arithmetic (Wikipedia)
Used to study the logical structure of arithmetic and set-theoretic axioms, especially nonstandard models and interpretability questions.
This topic covers applications of model theory across algebra, geometry, number theory, combinatorics, and computer science. It highlights how logical methods can solve or clarify problems outside logic itself.
Model theory applications (Wikipedia)
Used when model-theoretic methods are imported into another field to obtain uniformity, definability, or classification results.