The Info List - Set Theory

--- Advertisement ---

Set theory
Set theory
is a branch of mathematical logic that studies sets, which informally are collections of objects. Although any type of object can be collected into a set, set theory is applied most often to objects that are relevant to mathematics. The language of set theory can be used in the definitions of nearly all mathematical objects. The modern study of set theory was initiated by Georg Cantor
Georg Cantor
and Richard Dedekind
Richard Dedekind
in the 1870s. After the discovery of paradoxes in naive set theory, such as Russell's paradox, numerous axiom systems were proposed in the early twentieth century, of which the Zermelo– Fraenkel axioms, with or without the axiom of choice, are the best-known. Set theory
Set theory
is commonly employed as a foundational system for mathematics, particularly in the form of Zermelo– Fraenkel set theory with the axiom of choice. Beyond its foundational role, set theory is a branch of mathematics in its own right, with an active research community. Contemporary research into set theory includes a diverse collection of topics, ranging from the structure of the real number line to the study of the consistency of large cardinals.


1 History 2 Basic concepts and notation 3 Some ontology 4 Axiomatic set theory 5 Applications 6 Areas of study

6.1 Combinatorial set theory 6.2 Descriptive set theory 6.3 Fuzzy set
Fuzzy set
theory 6.4 Inner model theory 6.5 Large cardinals 6.6 Determinacy 6.7 Forcing 6.8 Cardinal invariants 6.9 Set-theoretic topology

7 Objections to set theory as a foundation for mathematics 8 See also 9 Notes 10 Further reading 11 External links


Georg Cantor.

Mathematical topics typically emerge and evolve through interactions among many researchers. Set theory, however, was founded by a single paper in 1874 by Georg Cantor: "On a Property of the Collection of All Real Algebraic Numbers".[1][2] Since the 5th century BC, beginning with Greek mathematician Zeno of Elea in the West and early Indian mathematicians in the East, mathematicians had struggled with the concept of infinity. Especially notable is the work of Bernard Bolzano
Bernard Bolzano
in the first half of the 19th century.[3] Modern understanding of infinity began in 1867–71, with Cantor's work on number theory. An 1872 meeting between Cantor and Richard Dedekind
Richard Dedekind
influenced Cantor's thinking and culminated in Cantor's 1874 paper. Cantor's work initially polarized the mathematicians of his day. While Karl Weierstrass
Karl Weierstrass
and Dedekind supported Cantor, Leopold Kronecker, now seen as a founder of mathematical constructivism, did not. Cantorian set theory eventually became widespread, due to the utility of Cantorian concepts, such as one-to-one correspondence among sets, his proof that there are more real numbers than integers, and the "infinity of infinities" ("Cantor's paradise") resulting from the power set operation. This utility of set theory led to the article "Mengenlehre" contributed in 1898 by Arthur Schoenflies to Klein's encyclopedia. The next wave of excitement in set theory came around 1900, when it was discovered that some interpretations of Cantorian set theory gave rise to several contradictions, called antinomies or paradoxes. Bertrand Russell
Bertrand Russell
and Ernst Zermelo
Ernst Zermelo
independently found the simplest and best known paradox, now called Russell's paradox: consider "the set of all sets that are not members of themselves", which leads to a contradiction since it must be a member of itself, and not a member of itself. In 1899 Cantor had himself posed the question "What is the cardinal number of the set of all sets?", and obtained a related paradox. Russell used his paradox as a theme in his 1903 review of continental mathematics in his The Principles of Mathematics. In 1906 English readers gained the book Theory of Sets of Points[4] by husband and wife William Henry Young and Grace Chisholm Young, published by Cambridge University Press. The momentum of set theory was such that debate on the paradoxes did not lead to its abandonment. The work of Zermelo
in 1908 and Abraham Fraenkel in 1922 resulted in the set of axioms ZFC, which became the most commonly used set of axioms for set theory. The work of analysts such as Henri Lebesgue
Henri Lebesgue
demonstrated the great mathematical utility of set theory, which has since become woven into the fabric of modern mathematics. Set theory
Set theory
is commonly used as a foundational system, although in some areas[which?] category theory is thought to be a preferred foundation. Basic concepts and notation[edit] Main articles: Set (mathematics)
Set (mathematics)
and Algebra
of sets Set theory
Set theory
begins with a fundamental binary relation between an object o and a set A. If o is a member (or element) of A, the notation o ∈ A is used. Since sets are objects, the membership relation can relate sets as well. A derived binary relation between two sets is the subset relation, also called set inclusion. If all the members of set A are also members of set B, then A is a subset of B, denoted A ⊆ B. For example, 1, 2 is a subset of 1, 2, 3 , and so is 2 but 1, 4 is not. As insinuated from this definition, a set is a subset of itself. For cases where this possibility is unsuitable or would make sense to be rejected, the term proper subset is defined. A is called a proper subset of B if and only if A is a subset of B, but A is not equal to B. Note also that 1, 2, and 3 are members (elements) of the set 1, 2, 3 but are not subsets of it; and in turn, the subsets, such as 1 , are not members of the set 1, 2, 3 . Just as arithmetic features binary operations on numbers, set theory features binary operations on sets. The:

Union of the sets A and B, denoted A ∪ B, is the set of all objects that are a member of A, or B, or both. The union of 1, 2, 3 and 2, 3, 4 is the set 1, 2, 3, 4 . Intersection of the sets A and B, denoted A ∩ B, is the set of all objects that are members of both A and B. The intersection of 1, 2, 3 and 2, 3, 4 is the set 2, 3 . Set difference
Set difference
of U and A, denoted U A, is the set of all members of U that are not members of A. The set difference 1, 2, 3 2, 3, 4 is 1 , while, conversely, the set difference 2, 3, 4 1, 2, 3 is 4 . When A is a subset of U, the set difference U A is also called the complement of A in U. In this case, if the choice of U is clear from the context, the notation Ac is sometimes used instead of U A, particularly if U is a universal set as in the study of Venn diagrams. Symmetric difference
Symmetric difference
of sets A and B, denoted A △ B or A ⊖ B, is the set of all objects that are a member of exactly one of A and B (elements which are in one of the sets, but not in both). For instance, for the sets 1, 2, 3 and 2, 3, 4 , the symmetric difference set is 1, 4 . It is the set difference of the union and the intersection, (A ∪ B) (A ∩ B) or (A B) ∪ (B A). Cartesian product
Cartesian product
of A and B, denoted A × B, is the set whose members are all possible ordered pairs (a, b) where a is a member of A and b is a member of B. The cartesian product of 1, 2 and red, white is (1, red), (1, white), (2, red), (2, white) . Power set
Power set
of a set A is the set whose members are all of the possible subsets of A. For example, the power set of 1, 2 is , 1 , 2 , 1, 2 .

Some basic sets of central importance are the empty set (the unique set containing no elements; occasionally called the null set though this name is ambiguous), the set of natural numbers, and the set of real numbers. Some ontology[edit] Main article: von Neumann universe

An initial segment of the von Neumann hierarchy.

A set is pure if all of its members are sets, all members of its members are sets, and so on. For example, the set containing only the empty set is a nonempty pure set. In modern set theory, it is common to restrict attention to the von Neumann universe of pure sets, and many systems of axiomatic set theory are designed to axiomatize the pure sets only. There are many technical advantages to this restriction, and little generality is lost, because essentially all mathematical concepts can be modeled by pure sets. Sets in the von Neumann universe are organized into a cumulative hierarchy, based on how deeply their members, members of members, etc. are nested. Each set in this hierarchy is assigned (by transfinite recursion) an ordinal number α, known as its rank. The rank of a pure set X is defined to be the least upper bound of all successors of ranks of members of X. For example, the empty set is assigned rank 0, while the set containing only the empty set is assigned rank 1. For each ordinal α, the set Vα is defined to consist of all pure sets with rank less than α. The entire von Neumann universe is denoted V. Axiomatic set theory[edit] Elementary set theory can be studied informally and intuitively, and so can be taught in primary schools using Venn diagrams. The intuitive approach tacitly assumes that a set may be formed from the class of all objects satisfying any particular defining condition. This assumption gives rise to paradoxes, the simplest and best known of which are Russell's paradox
Russell's paradox
and the Burali-Forti paradox. Axiomatic set theory was originally devised to rid set theory of such paradoxes.[5] The most widely studied systems of axiomatic set theory imply that all sets form a cumulative hierarchy. Such systems come in two flavors, those whose ontology consists of:

Sets alone. This includes the most common axiomatic set theory, Zermelo–Fraenkel set theory
Zermelo–Fraenkel set theory
(ZFC), which includes the axiom of choice. Fragments of ZFC

set theory, which replaces the axiom schema of replacement with that of separation; General set theory, a small fragment of Zermelo
set theory sufficient for the Peano axioms and finite sets; Kripke–Platek set theory, which omits the axioms of infinity, powerset, and choice, and weakens the axiom schemata of separation and replacement.

Sets and proper classes. These include Von Neumann–Bernays–Gödel set theory, which has the same strength as ZFC
for theorems about sets alone, and Morse–Kelley set theory
Morse–Kelley set theory
and Tarski–Grothendieck set theory, both of which are stronger than ZFC.

The above systems can be modified to allow urelements, objects that can be members of sets but that are not themselves sets and do not have any members. The systems of New Foundations
New Foundations
NFU (allowing urelements) and NF (lacking them) are not based on a cumulative hierarchy. NF and NFU include a "set of everything, " relative to which every set has a complement. In these systems urelements matter, because NF, but not NFU, produces sets for which the axiom of choice does not hold. Systems of constructive set theory, such as CST, CZF, and IZF, embed their set axioms in intuitionistic instead of classical logic. Yet other systems accept classical logic but feature a nonstandard membership relation. These include rough set theory and fuzzy set theory, in which the value of an atomic formula embodying the membership relation is not simply True or False. The Boolean-valued models of ZFC
are a related subject. An enrichment of ZFC
called internal set theory was proposed by Edward Nelson in 1977. Applications[edit] Many mathematical concepts can be defined precisely using only set theoretic concepts. For example, mathematical structures as diverse as graphs, manifolds, rings, and vector spaces can all be defined as sets satisfying various (axiomatic) properties. Equivalence and order relations are ubiquitous in mathematics, and the theory of mathematical relations can be described in set theory. Set theory
Set theory
is also a promising foundational system for much of mathematics. Since the publication of the first volume of Principia Mathematica, it has been claimed that most or even all mathematical theorems can be derived using an aptly designed set of axioms for set theory, augmented with many definitions, using first or second order logic. For example, properties of the natural and real numbers can be derived within set theory, as each number system can be identified with a set of equivalence classes under a suitable equivalence relation whose field is some infinite set. Set theory
Set theory
as a foundation for mathematical analysis, topology, abstract algebra, and discrete mathematics is likewise uncontroversial; mathematicians accept that (in principle) theorems in these areas can be derived from the relevant definitions and the axioms of set theory. Few full derivations of complex mathematical theorems from set theory have been formally verified, however, because such formal derivations are often much longer than the natural language proofs mathematicians commonly present. One verification project, Metamath, includes human-written, computer‐verified derivations of more than 12,000 theorems starting from ZFC
set theory, first order logic and propositional logic. Areas of study[edit] Set theory
Set theory
is a major area of research in mathematics, with many interrelated subfields. Combinatorial set theory[edit] Main article: Infinitary combinatorics Combinatorial set theory concerns extensions of finite combinatorics to infinite sets. This includes the study of cardinal arithmetic and the study of extensions of Ramsey's theorem
Ramsey's theorem
such as the Erdős–Rado theorem. Descriptive set theory[edit] Main article: Descriptive set theory Descriptive set theory is the study of subsets of the real line and, more generally, subsets of Polish spaces. It begins with the study of pointclasses in the Borel hierarchy and extends to the study of more complex hierarchies such as the projective hierarchy and the Wadge hierarchy. Many properties of Borel sets can be established in ZFC, but proving these properties hold for more complicated sets requires additional axioms related to determinacy and large cardinals. The field of effective descriptive set theory is between set theory and recursion theory. It includes the study of lightface pointclasses, and is closely related to hyperarithmetical theory. In many cases, results of classical descriptive set theory have effective versions; in some cases, new results are obtained by proving the effective version first and then extending ("relativizing") it to make it more broadly applicable. A recent area of research concerns Borel equivalence relations and more complicated definable equivalence relations. This has important applications to the study of invariants in many fields of mathematics. Fuzzy set
Fuzzy set
theory[edit] Main article: Fuzzy set
Fuzzy set
theory In set theory as Cantor defined and Zermelo
and Fraenkel axiomatized, an object is either a member of a set or not. In fuzzy set theory this condition was relaxed by Lotfi A. Zadeh
Lotfi A. Zadeh
so an object has a degree of membership in a set, a number between 0 and 1. For example, the degree of membership of a person in the set of "tall people" is more flexible than a simple yes or no answer and can be a real number such as 0.75. Inner model theory[edit] Main article: Inner model theory An inner model of Zermelo–Fraenkel set theory
Zermelo–Fraenkel set theory
(ZF) is a transitive class that includes all the ordinals and satisfies all the axioms of ZF. The canonical example is the constructible universe L developed by Gödel. One reason that the study of inner models is of interest is that it can be used to prove consistency results. For example, it can be shown that regardless of whether a model V of ZF satisfies the continuum hypothesis or the axiom of choice, the inner model L constructed inside the original model will satisfy both the generalized continuum hypothesis and the axiom of choice. Thus the assumption that ZF is consistent (has at least one model) implies that ZF together with these two principles is consistent. The study of inner models is common in the study of determinacy and large cardinals, especially when considering axioms such as the axiom of determinacy that contradict the axiom of choice. Even if a fixed model of set theory satisfies the axiom of choice, it is possible for an inner model to fail to satisfy the axiom of choice. For example, the existence of sufficiently large cardinals implies that there is an inner model satisfying the axiom of determinacy (and thus not satisfying the axiom of choice).[6] Large cardinals[edit] Main article: Large cardinal
Large cardinal
property A large cardinal is a cardinal number with an extra property. Many such properties are studied, including inaccessible cardinals, measurable cardinals, and many more. These properties typically imply the cardinal number must be very large, with the existence of a cardinal with the specified property unprovable in Zermelo-Fraenkel set theory. Determinacy[edit] Main article: Determinacy Determinacy
refers to the fact that, under appropriate assumptions, certain two-player games of perfect information are determined from the start in the sense that one player must have a winning strategy. The existence of these strategies has important consequences in descriptive set theory, as the assumption that a broader class of games is determined often implies that a broader class of sets will have a topological property. The axiom of determinacy (AD) is an important object of study; although incompatible with the axiom of choice, AD implies that all subsets of the real line are well behaved (in particular, measurable and with the perfect set property). AD can be used to prove that the Wadge degrees have an elegant structure. Forcing[edit] Main article: Forcing (mathematics) Paul Cohen
Paul Cohen
invented the method of forcing while searching for a model of ZFC
in which the continuum hypothesis fails, or a model of ZF in which the axiom of choice fails. Forcing adjoins to some given model of set theory additional sets in order to create a larger model with properties determined (i.e. "forced") by the construction and the original model. For example, Cohen's construction adjoins additional subsets of the natural numbers without changing any of the cardinal numbers of the original model. Forcing is also one of two methods for proving relative consistency by finitistic methods, the other method being Boolean-valued models. Cardinal invariants[edit] Main article: Cardinal invariant A cardinal invariant is a property of the real line measured by a cardinal number. For example, a well-studied invariant is the smallest cardinality of a collection of meagre sets of reals whose union is the entire real line. These are invariants in the sense that any two isomorphic models of set theory must give the same cardinal for each invariant. Many cardinal invariants have been studied, and the relationships between them are often complex and related to axioms of set theory. Set-theoretic topology[edit] Main article: Set-theoretic topology Set-theoretic topology
Set-theoretic topology
studies questions of general topology that are set-theoretic in nature or that require advanced methods of set theory for their solution. Many of these theorems are independent of ZFC, requiring stronger axioms for their proof. A famous problem is the normal Moore space question, a question in general topology that was the subject of intense research. The answer to the normal Moore space question was eventually proved to be independent of ZFC. Objections to set theory as a foundation for mathematics[edit] From set theory's inception, some mathematicians have objected to it as a foundation for mathematics. The most common objection to set theory, one Kronecker voiced in set theory's earliest years, starts from the constructivist view that mathematics is loosely related to computation. If this view is granted, then the treatment of infinite sets, both in naive and in axiomatic set theory, introduces into mathematics methods and objects that are not computable even in principle. The feasibility of constructivism as a substitute foundation for mathematics was greatly increased by Errett Bishop's influential book Foundations of Constructive Analysis.[7] A different objection put forth by Henri Poincaré
Henri Poincaré
is that defining sets using the axiom schemas of specification and replacement, as well as the axiom of power set, introduces impredicativity, a type of circularity, into the definitions of mathematical objects. The scope of predicatively founded mathematics, while less than that of the commonly accepted Zermelo- Fraenkel theory, is much greater than that of constructive mathematics, to the point that Solomon Feferman has said that "all of scientifically applicable analysis can be developed [using predicative methods]".[8] Ludwig Wittgenstein
Ludwig Wittgenstein
condemned set theory. He wrote that "set theory is wrong", since it builds on the "nonsense" of fictitious symbolism, has "pernicious idioms", and that it is nonsensical to talk about "all numbers".[9] Wittgenstein's views about the foundations of mathematics were later criticised by Georg Kreisel and Paul Bernays, and investigated by Crispin Wright, among others. Category theorists have proposed topos theory as an alternative to traditional axiomatic set theory. Topos theory
Topos theory
can interpret various alternatives to that theory, such as constructivism, finite set theory, and computable set theory.[10][11] Topoi also give a natural setting for forcing and discussions of the independence of choice from ZF, as well as providing the framework for pointless topology and Stone spaces.[12] An active area of research is the univalent foundations and related to it homotopy type theory. Here, sets may be defined as certain kinds of types, with universal properties of sets arising from higher inductive types. Principles such as the axiom of choice and the law of the excluded middle appear in a spectrum of different forms, some of which can be proven, others which correspond to the classical notions; this allows for a detailed discussion of the effect of these axioms on mathematics.[13][14] See also[edit]

Set theory
Set theory
portal Mathematics

Glossary of set theory Category theory List of set theory topics Relational model – borrows from set theory


^ Cantor, Georg (1874), "Ueber eine Eigenschaft des Inbegriffes aller reellen algebraischen Zahlen", J. Reine Angew. Math., 77: 258–262, doi:10.1515/crll.1874.77.258  ^ Johnson, Philip (1972), A History of Set Theory, Prindle, Weber & Schmidt, ISBN 0-87150-154-6  ^ Bolzano, Bernard (1975), Berg, Jan, ed., Einleitung zur Größenlehre und erste Begriffe der allgemeinen Größenlehre, Bernard-Bolzano-Gesamtausgabe, edited by Eduard Winter et al., Vol. II, A, 7, Stuttgart, Bad Cannstatt: Friedrich Frommann Verlag, p. 152, ISBN 3-7728-0466-7  ^ William Henry Young & Grace Chisholm Young (1906) Theory of Sets of Points, link from Internet Archive ^ In his 1925, John von Neumann
John von Neumann
observed that "set theory in its first, "naive" version, due to Cantor, led to contradictions. These are the well-known antinomies of the set of all sets that do not contain themselves (Russell), of the set of all transfinte ordinal numbers (Burali-Forti), and the set of all finitely definable real numbers (Richard)." He goes on to observe that two "tendencies" were attempting to "rehabilitate" set theory. Of the first effort, exemplified by Bertrand Russell, Julius König, Hermann Weyl
Hermann Weyl
and L. E. J. Brouwer, von Neumann called the "overall effect of their activity . . . devastating". With regards to the axiomatic method employed by second group composed of Zermelo, Abraham Fraenkel
Abraham Fraenkel
and Arthur Moritz Schoenflies, von Neumann worried that "We see only that the known modes of inference leading to the antinomies fail, but who knows where there are not others?" and he set to the task, "in the spirit of the second group", to "produce, by means of a finite number of purely formal operations . . . all the sets that we want to see formed" but not allow for the antinomies. (All quotes from von Neumann 1925 reprinted in van Heijenoort, Jean (1967, third printing 1976), From Frege to Gödel: A Source Book
in Mathematical Logic, 1879–1931, Harvard University Press, Cambridge MA, ISBN 0-674-32449-8 (pbk). A synopsis of the history, written by van Heijenoort, can be found in the comments that precede von Neumann's 1925. ^ Jech, Thomas (2003), Set Theory, Springer Monographs in Mathematics (Third Millennium ed.), Berlin, New York: Springer-Verlag, p. 642, ISBN 978-3-540-44085-7, Zbl 1007.03002  ^ Bishop, Errett 1967. Foundations of Constructive Analysis, New York: Academic Press. ISBN 4-87187-714-0 ^ Solomon Feferman, 1998, In the Light of Logic, Oxford Univ. Press (New York), p.280-283 and 293-294 ^ Wittgenstein, Ludwig (1975). Philosophical Remarks, §129, §174. Oxford: Basil Blackwell. ISBN 0631191305.  ^ Ferro, A.; Omodeo, E. G.; Schwartz, J. T. (1980), "Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions", Comm. Pure Appl. Math., 33 (5): 599–608, doi:10.1002/cpa.3160330503  ^ Cantone, D.; Ferro, A.; Omodeo, E. G. (1989), Computable Set Theory, International Series of Monographs on Computer Science, Oxford Science Publications, Oxford, UK: Clarendon Press, p. xii, 347, ISBN 0-19-853807-3  ^ Saunders Mac Lane
Saunders Mac Lane
and Ieke Moerdijk (1992) Sheaves in Geometry
and Logic: a First Introduction to Topos Theory. Springer Verlag. ^ homotopy type theory in nLab ^ Homotopy Type Theory: Univalent Foundations of Mathematics. The Univalent Foundations Program. Institute for Advanced Study.

Further reading[edit]

Devlin, Keith, 1993. The Joy of Sets (2nd ed.). Springer Verlag, ISBN 0-387-94094-4 Ferreirós, Jose, 2007 (1999). Labyrinth of Thought: A history of set theory and its role in modern mathematics. Basel, Birkhäuser. ISBN 978-3-7643-8349-7 Johnson, Philip, 1972. A History of Set Theory. Prindle, Weber & Schmidt ISBN 0-87150-154-6 Kunen, Kenneth, 1980. Set Theory: An Introduction to Independence Proofs. North-Holland, ISBN 0-444-85401-0. Potter, Michael, 2004. Set Theory
Set Theory
and Its Philosophy: A Critical Introduction. Oxford University Press. Tiles, Mary, 2004 (1989). The Philosophy of Set Theory: An Historical Introduction to Cantor's Paradise. Dover Publications. ISBN 978-0-486-43520-6

External links[edit]

Wikibooks has a book on the topic of: Set Theory

Wikibooks has a book on the topic of: Discrete mathematics/Set theory

Foreman, Matthew, Akihiro Kanamori, eds. Handbook of Set Theory. 3 vols., 2010. Each chapter surveys some aspect of contemporary research in set theory. Does not cover established elementary set theory, on which see Devlin (1993). Hazewinkel, Michiel, ed. (2001) [1994], "Axiomatic set theory", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4  Hazewinkel, Michiel, ed. (2001) [1994], "Set theory", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4  Jech, Thomas (2002). "Set Theory", Stanford Encyclopedia of Philosophy. Schoenflies, Arthur (1898). Mengenlehre in Klein's encyclopedia. Online books, and library resources in your library and in other libraries about set theory

v t e

Set theory



countable dependent

Constructibility (V=L) Determinacy Extensionality Infinity Limitation of size Pairing Power set Regularity Union Martin's axiom


replacement specification


Cartesian product Complement De Morgan's laws Disjoint union Intersection Power set Set difference Symmetric difference Union

Concepts Methods

Cardinality Cardinal number (large) Class Constructible universe Continuum hypothesis Diagonal argument Element

ordered pair tuple

Family Forcing One-to-one correspondence Ordinal number Transfinite induction Venn diagram

Set types

Countable Empty Finite (hereditarily) Fuzzy Infinite Recursive Subset · Superset Transitive Uncountable Universal


Alternative Axiomatic Naive Cantor's theorem



Principia Mathematica

New Foundations


von Neumann–Bernays–Gödel


Kripke–Platek Tarski–Grothendieck

Paradoxes Problems

Russell's paradox Suslin's problem Burali-Forti paradox

Set theorists

Abraham Fraenkel Bertrand Russell Ernst Zermelo Georg Cantor John von Neumann Kurt Gödel Paul Bernays Paul Cohen Richard Dedekind Thomas Jech Thoralf Skolem Willard Quine

v t e

Areas of mathematics

outline topic lists



History of mathematics Philosophy of mathematics Philosophy of mathematics
Philosophy of mathematics
education Information theory Lie theory Order theory Representation theory Set theory Category theory Control theory Graph theory Computation


theory Elementary Linear Multilinear Abstract Combinatorics Group theory


Analysis Differential equations / Dynamical systems Numerical analysis Optimization Functional analysis


Discrete Algebraic Analytic Differential Finite Topology Trigonometry


Probability Mathematical physics Mathematical statistics Statistics Computer science Game theory Recreational mathematics Mathematics
and art Mathematics
education Mathematical logic


Pure Applied Discrete Computational

Category Portal Commons WikiProject

v t e

Mathematical logic


Formal language Formation rule Formal proof Formal semantics Well-formed formula Set Element Class Classical logic Axiom Rule of inference Relation Theorem Logical consequence Type theory Symbol Syntax Theory


Formal system Deductive system Axiomatic system Hilbert style systems Natural deduction Sequent calculus

Traditional logic

Proposition Inference Argument Validity Cogency Syllogism Square of opposition Venn diagram

Propositional calculus Boolean logic

Boolean functions Propositional calculus Propositional formula Logical connectives Truth tables Many-valued logic

Predicate logic

First-order Quantifiers Predicate Second-order Monadic predicate calculus

Naive set theory

Set Empty set Element Enumeration Extensionality Finite set Infinite set Subset Power set Countable set Uncountable set Recursive set Domain Codomain Image Map Function Relation Ordered pair

Set theory

Foundations of mathematics Zermelo– Fraenkel set theory Axiom
of choice General set theory Kripke–Platek set theory Von Neumann–Bernays–Gödel set theory Morse–Kelley set theory Tarski–Grothendieck set theory

Model theory

Model Interpretation Non-standard model Finite model theory Truth value Validity

Proof theory

Formal proof Deductive system Formal system Theorem Logical consequence Rule of inference Syntax

Computability theory

Recursion Recursive set Recursively enumerable set Decision problem Church–Turing thesis Computable function Primitive recursive function

v t e

Major fields of computer science

Note: This template roughly follows the 2012 ACM Computing Classification System.


Printed circuit board Peripheral Integrated circuit Very-large-scale integration Energy consumption Electronic design automation

Computer systems organization

Computer architecture Embedded system Real-time computing Dependability


Network architecture Network protocol Network components Network scheduler Network performance evaluation Network service

Software organization

Interpreter Middleware Virtual machine Operating system Software quality

Software notations and tools

Programming paradigm Programming language Compiler Domain-specific language Modeling language Software framework Integrated development environment Software configuration management Software library Software repository

Software development

Software development
Software development
process Requirements analysis Software design Software construction Software deployment Software maintenance Programming team Open-source model

Theory of computation

Model of computation Formal language Automata theory Computational complexity theory Logic Semantics


design Analysis of algorithms Randomized algorithm Computational geometry

Mathematics of computing

Discrete mathematics Probability Statistics Mathematical software Information theory Mathematical analysis Numerical analysis

Information systems

Database management system Information storage systems Enterprise information system Social information systems Geographic information system Decision support system Process control
Process control
system Multimedia information system Data mining Digital library Computing platform Digital marketing World Wide Web Information retrieval


Cryptography Formal methods Security services Intrusion detection system Hardware security Network security Information security Application security

Human–computer interaction

Interaction design Social computing Ubiquitous computing Visualization Accessibility


Concurrent computing Parallel computing Distributed computing Multithreading Multiprocessing

Artificial intelligence

Natural language processing Knowledge representation and reasoning Computer vision Automated planning and scheduling Search methodology Control method Philosophy of artificial intelligence Distributed artificial intelligence

Machine learning

Supervised learning Unsupervised learning Reinforcement learning Multi-task learning Cross-validation


Animation Rendering Image manipulation Graphics processing unit Mixed reality Virtual reality Image compression Solid modeling

Applied computing

E-commerce Enterprise software Computational mathematics Computational physics Computational chemistry Computational biology Computational social science Computational engineering Computational healthcare Digital art Electronic publishing Cyberwarfare Electronic voting Video game Word processing Operations research Educational technology Document management

Book Category Portal WikiProject Commons

Authority control

GND: 40747