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 studies set theory, including cardinals, ordinals, axioms, and independence methods that shape the foundations of modern mathematics. It is used to formalize infinite structures, compare sizes of infinity, and analyze consistency strength across theories. Applications appear throughout logic, topology, analysis, and combinatorics, especially when precise control of infinite constructions is required.
This topic covers partition relations, a central part of combinatorial set theory that studies how large sets decompose under colourings and partitions. It generalizes classical Ramsey-style phenomena.
Partition calculus (Wikipedia)
Used to study structural regularity in infinite combinatorics and to generalize Ramsey theory.
This topic covers combinatorial set theory more broadly, including club and stationary sets, reflection, and infinite combinatorial principles. It studies how infinite sets behave under structural constraints.
Combinatorial set theory (Wikipedia)
Used to analyse structural regularity and to derive combinatorial consequences of set-theoretic axioms.
This topic covers ordinal and cardinal numbers, the fundamental tools for measuring order type and size in set theory. They underpin almost every later construction in the subject.
Used to formalize infinity, compare sizes of sets, and perform transfinite constructions.
This topic covers descriptive set theory, which studies definable sets and functions in Polish spaces and the Borel hierarchy. It is a major interface between set theory, analysis, and topology.
Descriptive set theory (Wikipedia)
Used to classify definable subsets of Polish spaces and to study regularity properties of sets of reals.
This topic covers other classical set theory, including combinatorial and foundational questions not isolated elsewhere in the section. It often captures techniques and results that do not fit a single specialized heading.
Used as a catch-all for foundational set-theoretic results that cut across the usual subheadings.
This topic covers the axiom of choice and related propositions such as Zorn's lemma and the well-ordering theorem. It is one of the main independence-sensitive principles in set theory.
Used whenever existence arguments rely on selecting elements from arbitrary families of sets.
This topic covers the axiomatics of classical set theory, especially Zermelo-Fraenkel style axiom systems and their variants. It explains how modern set theory is built from a small foundational core.
Zermelo-Fraenkel set theory (Wikipedia)
Used to specify the foundational background for almost all mainstream mathematics.
This topic covers consistency and independence results in set theory, especially the methods used to show that certain propositions cannot be proved or refuted from standard axioms. Forcing is the central technique here.
Used to show that a proposition is neither provable nor refutable from a given theory.
This topic covers the continuum hypothesis and Martin's axiom, two key principles in modern set theory that describe the size and structure of the continuum. They are central to independence and forcing arguments.
Continuum hypothesis (Wikipedia)
Used to explore the behaviour of the continuum under different set-theoretic assumptions.
This topic covers large cardinals, which are axioms asserting the existence of very large infinite cardinals with strong combinatorial or reflection properties. They provide a hierarchy of strength above ordinary ZFC.
Used to calibrate the strength of set-theoretic axioms and to prove deep reflection theorems.
This topic covers fuzzy set theory, which extends classical set membership to graded membership values. It provides the set-theoretic foundation for fuzzy logic and approximate reasoning.
Used to model vague categories and partial membership in applied and theoretical contexts.
This topic covers applications of set theory, ranging from topology and analysis to algebra and theoretical computer science. It emphasizes how set-theoretic methods clarify structures and independence phenomena in other fields.
Set theory applications (Wikipedia)
Used whenever a mathematical question depends on the structure of infinite sets or on foundational axioms beyond the bare minimum.