Set theory

Short description: Branch of mathematics that studies sets

Not to be confused with Set theory (music).

A Venn diagram illustrating the intersection of two sets

Template:Math topics TOC

Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory – as a branch of mathematics – is mostly concerned with those that are relevant to mathematics as a whole.[1][2]

The modern study of set theory was initiated by the German mathematicians Richard Dedekind and Georg Cantor in the 1870s. In particular, Georg Cantor is commonly considered the founder of set theory.[3] The non-formalized systems investigated during this early stage go under the name of naive set theory.[4] After the discovery of paradoxes within naive set theory (e.g. Russell's paradox,[5] Cantor's paradox,[6] and the Burali-Forti paradox,[7] et al.), various axiomatic systems were proposed in the early twentieth century, of which Zermelo–Fraenkel set theory (with or without the axiom of choice) is still the best-known and most studied.[8]

Set theory is commonly employed as a foundational system for the whole of mathematics,[9] particularly in the form of Zermelo–Fraenkel set theory with the axiom of choice.[10] Besides its foundational role, set theory also provides the framework to develop a mathematical theory of infinity,[11] and has various applications in computer science (such as in the theory of relational algebra),[12][13] philosophy,[1] formal semantics,[14] and evolutionary dynamics.[15] Its foundational appeal, together with its paradoxes, and its implications for the concept of infinity and its multiple applications have made set theory an area of major interest for logicians and philosophers of mathematics.[16][4] Contemporary research into set theory covers a vast array of topics, ranging from the structure of the real number line to the study of the consistency of large cardinals.[1]

## Contents

* 1 History
* 1.1 Early history
* 1.2 Naive set theory
* 2 Basic concepts and notation
* 3 Ontology
* 4 Formalized set theory
* 5 Applications
* 6 Areas of study
* 6.1 Descriptive set theory
* 6.2 Fuzzy set theory
* 6.3 Inner model theory
* 6.4 Large cardinals
* 6.5 Determinacy
* 6.6 Forcing
* 6.7 Cardinal invariants
* 7 Relationships to other areas of mathematics
* 7.1 Set-theoretic topology
* 7.2 Combinatorial set theory
* 7.3 Category theory
* 8 Controversy
* 9 Mathematical education
* 10 Bibliography
* 11 See also
* 12 Notes
* 13 Citations
* 14 References
* 15 External links

## History

### Early history

Porphyrian tree by Purchotius (1730), presenting Aristotle's Categories

The basic notion of grouping objects has existed since at least the emergence of numbers, and the notion of treating sets as their own objects has existed since at least the Tree of Porphyry in 3rd-century CE.[17] The simplicity and ubiquity of sets makes it hard to determine the origin of sets as now used in mathematics; however, Bernard Bolzano's Paradoxes of the Infinite (Paradoxien des Unendlichen, 1851) is generally considered the first rigorous introduction of sets to mathematics. In his work, he (among other things) expanded on Galileo's paradox, and introduced one-to-one correspondence of infinite sets, for example between the intervals [0,5] and [0,12] by the relation 5y=12x. However, he resisted saying these sets were equinumerous, and his work is generally considered to have been uninfluential in mathematics of his time.[18][19]

Before mathematical set theory, basic concepts of infinity were considered to be in the domain of philosophy (see: Infinity and Infinity § History). Since the 5th century BC, beginning with Greek philosopher Zeno of Elea in the West (and early Indian mathematicians in the East), mathematicians had struggled with the concept of infinity. With the development of calculus in the late 17th century, philosophers began to generally distinguish between potential and actual infinity, wherein mathematics was only considered in the latter.[20] Carl Friedrich Gauss famously stated:

> Infinity is nothing more than a figure of speech which helps us talk about limits. The notion of a completed infinity doesn't belong in mathematics.[21]

Development of mathematical set theory was motivated by several mathematicians. Bernhard Riemann's lecture On the Hypotheses which lie at the Foundations of Geometry (1854) proposed new ideas about topology.[22] His lectures also introduced the concept of basing mathematics in terms of sets or manifolds in the sense of a class (which he called Mannigfaltigkeit) now called point-set topology. The lecture was published by Richard Dedekind in 1868, along with Riemann's paper on trigonometric series (which presented the Riemann integral). The latter was the starting point for a movement in real analysis of the study of “seriously” discontinuous functions. A young Georg Cantor entered into this area, which led him to the study of point-sets. Around 1871, influenced by Riemann, Dedekind began working with sets in his publications, which dealt very clearly and precisely with equivalence relations, partitions of sets, and homomorphisms. Thus, many of the usual set-theoretic procedures of twentieth-century mathematics go back to his work. However, he did not publish a formal explanation of his set theory until 1888.

### Naive set theory

Main article: Naive set theory

Georg Cantor, 1894

Set theory, as understood by modern mathematicians, is generally considered to be founded by a single paper in 1874 by Georg Cantor titled On a Property of the Collection of All Real Algebraic Numbers.[23][24][25] In his paper, he developed the notion of cardinality, comparing the sizes of two sets by setting them in one-to-one correspondence. His "revolutionary discovery" was that the set of all real numbers is uncountable, that is, one cannot put all real numbers in a list. This theorem is proved using Cantor's first uncountability proof, which differs from the more familiar proof using his diagonal argument.

Cantor introduced fundamental constructions in set theory, such as the power set of a set A, which is the set of all possible subsets of A. He later proved that the size of the power set of A is strictly larger than the size of A, even when A is an infinite set; this result soon became known as Cantor's theorem. Cantor developed a theory of transfinite numbers, called cardinals and ordinals, which extended the arithmetic of the natural numbers. His notation for the cardinal numbers was the Hebrew letter ℵ (ℵ, aleph) with a natural number subscript; for the ordinals he employed the Greek letter ω (ω, omega).

Set theory was beginning to become an essential ingredient of the new “modern” approach to mathematics. Originally, Cantor's theory of transfinite numbers was regarded as counter-intuitive – even shocking. This caused it to encounter resistance from mathematical contemporaries such as Leopold Kronecker and Henri Poincaré and later from Hermann Weyl and L. E. J. Brouwer, while Ludwig Wittgenstein raised philosophical objections (see: Controversy over Cantor's theory).[lower-alpha 1]

Gottlob Frege, c. 1879

Despite the controversy, Cantor's set theory gained remarkable ground around the turn of the 20th century with the work of several notable mathematicians and philosophers. Richard Dedekind, around the same time, began working with sets in his publications, and was famously constructing the real numbers in 1872 using Dedekind cuts. Cantor and Dedekind were in correspondence about set theory, especially in the 1870s.[26] However, Dedekind's algebraic style only began to find followers in the 1890s. Cantor also worked with Giuseppe Peano in developing the Peano axioms, which formalized natural-number arithmetic, using set-theoretic ideas, which also introduced the epsilon symbol for set membership. Possibly most prominently, Gottlob Frege began to develop his Foundations of Arithmetic.

In his work, Frege tries to ground all mathematics in terms of logical axioms using Cantor's cardinality. For example, the sentence "the number of horses in the barn is four" means that four objects fall under the concept horse in the barn. Frege attempted to explain our grasp of numbers through cardinality ('the number of...', or Nx:Fx), relying on Hume's principle.

Bertrand Russell, 1936

However, Frege's work was short-lived, as it was found by Bertrand Russell that his axioms lead to a contradiction. Specifically, Frege's Basic Law V (now known as the axiom schema of unrestricted comprehension). According to Basic Law V, for any sufficiently well-defined property, there is the set of all and only the objects that have that property. The contradiction, called Russell's paradox, is shown as follows:

> Let R be the set of all sets that are not members of themselves. (This set is sometimes called "the Russell set".) If R is not a member of itself, then its definition entails that it is a member of itself; yet, if it is a member of itself, then it is not a member of itself, since it is the set of all sets that are not members of themselves. The resulting contradiction is Russell's paradox. In symbols:

>     Let R={x∣x∉x}, then R∈R⟺R∉R

This came around a time of several paradoxes or counter-intuitive results. For example, that the parallel postulate cannot be proved, the existence of mathematical objects that cannot be computed or explicitly described, and the existence of theorems of arithmetic that cannot be proved with Peano arithmetic. The result was a foundational crisis of mathematics.

## Basic concepts and notation

Main articles: Set (mathematics) and Algebra of sets

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. A set is described by listing elements separated by commas, or by a characterizing property of its elements, within braces { }.[27] Since sets are objects, the membership relation can relate sets as well, i.e., sets themselves can be members of other sets.

The 11 exhaustive logical relations between two sets. While the text focuses on membership and inclusion, these cases illustrate the complete topological variety of how two sets can relate.

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 implied by 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, variously denoted A⊂B, A⊊B, or A⫋B (note however that the notation A⊂B is sometimes used synonymously with A⊆B; that is, allowing the possibility that A and B are equal). We call A a proper subset of B if and only if A is a subset of B, but A is not equal to B. Also, 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}. More complicated relations can exist; for example, the set {1} is both a member and a proper subset of the set {1, {1}}.

Just as arithmetic features binary operations on numbers, set theory features binary operations on sets.[28] The following is a partial list of them:

* 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.[29] For example, 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.[30] For example, the intersection of {1, 2, 3} and {2, 3, 4} is the set {2, 3}.
* Set difference of U and A, denoted U ∖ A, is the set of all members of U that are not members of A.[31] 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.[32]
* 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 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. For example, the Cartesian product of {1, 2} and {red, white} is {(1, red), (1, white), (2, red), (2, white)}.[33]

Some basic sets of central importance are the set of natural numbers, the set of real numbers and the empty set – the unique set containing no elements. The empty set is also occasionally called the null set,[34] though this name is ambiguous and can lead to several interpretations. The empty set can be denoted with empty braces "{}" or the symbol "∅" or "∅".

The power set of a set A, denoted 𝒫(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} }. Notably, 𝒫(A) contains both A and the empty set.

## Ontology

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 ordinal that is strictly greater than the rank of any of its elements. 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.

## Formalized set theory

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 and the Burali-Forti paradox. Axiomatic set theory was originally devised to rid set theory of such paradoxes.[note 1]

The most widely studied systems of axiomatic set theory imply that all sets form a cumulative hierarchy.[lower-alpha 2] 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 with the axiom of choice (ZFC). Fragments of ZFC include:
* Zermelo 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 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. Zermelo set theory was originally defined over a domain consisting of both sets and urelements.

The New Foundations systems of NFU (allowing urelements) and NF (lacking them), associate with Willard Van Orman Quine, 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. Despite NF's ontology not reflecting the traditional cumulative hierarchy and violating well-foundedness, Thomas Forster has argued that it does reflect an iterative conception of set.[35]

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.[36]

## Applications

Many mathematical concepts can be defined precisely using only set theoretic concepts. For example, mathematical structures as diverse as graphs, manifolds, rings, vector spaces, and relational algebras 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.[37][38]

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 of these number systems can be defined by representing their elements as sets of specific forms.[39]

Set theory as a foundation for mathematical analysis, topology, abstract algebra, and discrete mathematics is likewise uncontroversial; mathematicians accept (in principle) that theorems in these areas can be derived from the relevant definitions and the axioms of set theory. However, it remains that few full derivations of complex mathematical theorems from set theory have been formally verified, since 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.[40]

## Areas of study

Set theory is a major area of research in mathematics with many interrelated subfields:

### Descriptive set theory

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 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 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

Main article: Inner model theory

An inner model of 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).[41]

### Large cardinals

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

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

Main article: Forcing (mathematics)

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

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.

## Relationships to other areas of mathematics

### Set-theoretic topology

Main article: 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.

### Combinatorial set theory

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 such as the Erdős–Rado theorem.

### Category theory

Main article: Category theory

Set theory and category theory are distinct but closely related areas of mathematics. Set theory is the foundation for describing collections of mathematical objects; category theory often builds on this foundation to describe the relationships between mathematical objects. Because of the strong relationship between set theory and category theory, the two fields frequently inform one another.[42] Both set theory and category theory attempt to provide a foundation for mathematics; however they take different approaches to this objective. Set theory begins with the idea of the "set" and the criteria for membership. Category theory begins with mathematical objects and the relationships between them, treating sets as one particular kind of structure within this broader framework.[43]

## Controversy

Main article: Controversy over Cantor's theory

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.[44]

A different objection put forth by 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]".[45]

Ludwig Wittgenstein condemned set theory philosophically for its connotations of mathematical platonism.[46] 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".[47] Wittgenstein identified mathematics with algorithmic human deduction;[48] the need for a secure foundation for mathematics seemed, to him, nonsensical.[49] Moreover, since human effort is necessarily finite, Wittgenstein's philosophy required an ontological commitment to radical constructivism and finitism. Meta-mathematical statements – which, for Wittgenstein, included any statement quantifying over infinite domains, and thus almost all modern set theory – are not mathematics.[50] Few modern philosophers have adopted Wittgenstein's views after a spectacular blunder in Remarks on the Foundations of Mathematics: Wittgenstein attempted to refute Gödel's incompleteness theorems after having only read the abstract. As reviewers Kreisel, Bernays, Dummett, and Goodstein all pointed out, many of his critiques did not apply to the paper in full. Only recently have philosophers such as Crispin Wright begun to rehabilitate Wittgenstein's arguments.[51]

Category theorists have proposed topos theory as an alternative to traditional axiomatic set theory. Topos theory can interpret various alternatives to that theory, such as constructivism, finite set theory, and computable set theory.[52][53] 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.[54]

An active area of research is the univalent foundations and related to it homotopy type theory. Within homotopy type theory, a set may be regarded as a homotopy 0-type, with universal properties of sets arising from the inductive and recursive properties of higher inductive types. Principles such as the axiom of choice and the law of the excluded middle can be formulated in a manner corresponding to the classical formulation in set theory or perhaps in a spectrum of distinct ways unique to type theory. Some of these principles may be proven to be a consequence of other principles. The variety of formulations of these axiomatic principles allows for a detailed analysis of the formulations required in order to derive various mathematical results.[55][56]

## Mathematical education

As set theory gained popularity as a foundation for modern mathematics, there has been support for the idea of introducing the basics of naive set theory early in mathematics education.

In the US in the 1960s, the New Math experiment aimed to teach basic set theory, among other abstract concepts, to primary school students but was met with much criticism.[57] The math syllabus in European schools followed this trend and currently includes the subject at different levels in all grades. Venn diagrams are widely employed to explain basic set-theoretic relationships to primary school students (even though John Venn originally devised them as part of a procedure to assess the validity of inferences in term logic).

Set theory is used to introduce students to logical operators (NOT, AND, OR), and semantic or rule description (technically intensional definition)[58] of sets (e.g. "months starting with the letter A"), which may be useful when learning computer programming, since Boolean logic is used in various programming languages. Likewise, sets and other collection-like objects, such as multisets and lists, are common datatypes in computer science and programming.[59]

In addition to that, certain sets are commonly used in mathematical teaching (such as the sets ℕ of natural numbers, ℤ of integers, ℝ of real numbers, etc.). These are commonly used when defining a mathematical function as a relation from one set (the domain) to another set (the range).[60]

## Bibliography

* Paul Halmos, Naive Set Theory, 1960, Springer Verlag.
* Thomas Jech, Set Theory, The Third Millennium Edition, revised and expanded. Springer, 2006, 772 pages, ISBN 978-3-540-44085-7. Set theory at Google Books
* Matthew Foreman and Akihiro Kanamori (editors), Handbook of Set Theory, 2010, 2196 pages ISBN 978-1-4020-4843-2 (Print) ISBN 978-1-4020-5764-9 (Online)

## See also

* Class (set theory)
* Elementary Theory of the Category of Sets
* Glossary of set theory
* List of set theory topics
* Relational model – borrows from set theory
* Structural set theory
* Venn diagram

## Notes

1. ↑ In his 1925 paper ""An Axiomatization of Set Theory", 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 transfinite 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 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, Fraenkel and 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 paper.

1. ↑ The objections to Cantor's work were occasionally fierce: Leopold Kronecker's public opposition and personal attacks included describing Cantor as a "scientific charlatan", a "renegade" and a "corrupter of youth". Kronecker objected to Cantor's proofs that the algebraic numbers are countable, and that the transcendental numbers are uncountable, results now included in a standard mathematics curriculum. Writing decades after Cantor's death, Wittgenstein lamented that mathematics is "ridden through and through with the pernicious idioms of set theory", which he dismissed as "utter nonsense" that is "laughable" and "wrong".
2. ↑ This is the converse for ZFC; V is a model of ZFC.

## Citations

1. ↑ 1.0 1.1 1.2 Bagaria, Joan (January 31, 2023). "Set Theory". in Zalta, Edward N.. Metaphysics Research Lab, Stanford University. https://plato.stanford.edu/entries/set-theory/.
2. ↑ Ferreirós, José (December 3, 2025). "The Early Development of Set Theory". in Zalta, Edward N.. Metaphysics Research Lab, Stanford University. https://plato.stanford.edu/entries/settheory-early/.
3. ↑ Dauben, Joseph Warren (1990). Georg Cantor: His Mathematics and Philosophy of the Infinite. Princeton: Princeton University Press.
4. ↑ 4.0 4.1 Kanamori, Akihiro (1996). "The Mathematical Development of Set Theory from Cantor to Cohen". Bulletin of Symbolic Logic 2 (1): 1–71. doi:10.2307/421046.
5. ↑ Rang, B.; Thomas, W. (1981). "Zermelo's discovery of the "Russell Paradox"". Historia Mathematica 8 (1): 15–22. doi:10.1016/0315-0860(81)90002-1.
6. ↑ Rowe, David E. (2024). "On the Origins of Cantor's Paradox". The Mathematical Intelligencer 46 (2): 102–116. doi:10.1007/s00283-022-10259-x.
7. ↑ Moore, Gregory H.; Garciadiego, Alejandro (1981). "Burali-Forti's paradox: A reappraisal of its origins". Historia Mathematica 8 (3): 319–350. doi:10.1016/0315-0860(81)90070-7.
8. ↑ Kanamori, Akihiro (2004). "Zermelo and set theory". Bulletin of Symbolic Logic 10 (4): 487–553. doi:10.2178/bsl/1102083759.
9. ↑ Džamonja, Mirna (2017). "Set Theory and its Place in the Foundations of Mathematics: A New Look at an Old Question". Journal of Indian Council of Philosophical Research 34 (2): 415–424. doi:10.1007/s40961-016-0082-6.
10. ↑ Feferman, Solomon; Friedman, Harvey M.; Maddy, Penelope; Steel, John R. (2000). "Does Mathematics Need New Axioms?". Bulletin of Symbolic Logic 6 (4): 401–446. doi:10.2307/420965.
11. ↑ Ferreirós, José (1995). ""What Fermented in Me for Years": Cantor's discovery of transfinite numbers". Historia Mathematica 22 (1): 33–42. doi:10.1006/hmat.1995.1003.
12. ↑ Codd, E. F. (1970). "A Relational Model of Data for Large Shared Data Banks". Communications of the ACM 13 (6): 377–387. doi:10.1145/362384.362685.
13. ↑ Codd, E. F. (1972). "Relational Completeness of Data Base Sublanguages". in Rustin, Randall. Data Base Systems: Courant Computer Science Symposia Series 6. Prentice-Hall. pp. 65–98.
14. ↑ Montague, Richard (1970). "Universal Grammar". Theoria 36 (3): 373–398. doi:10.1111/j.1755-2567.1970.tb00434.x.
15. ↑ Tarnita, Corina E.; Antal, Tibor; Ohtsuki, Hisashi; Nowak, Martin A. (2009). "Evolutionary dynamics in set structured populations". Proceedings of the National Academy of Sciences 106 (21): 8601–8604. doi:10.1073/pnas.0903019106.
16. ↑ Maddy, Penelope (1988). "Believing the Axioms. (2 parts)". The Journal of Symbolic Logic 53 (2,3): 481–511, 736–764. doi:10.2307/2274520.
17. ↑ Evangeliou, Christos (1985). "Aristotle's Doctrine of Predicables and Porphyry's Isagoge". Journal of the History of Philosophy 23 (1): 15–34. doi:10.1353/hph.1985.0004.
18. ↑ Ferreirós, José (2024), Zalta, Edward N.; Nodelman, Uri, eds., The Early Development of Set Theory (Winter 2024 ed.), Metaphysics Research Lab, Stanford University, https://plato.stanford.edu/entries/settheory-early/, retrieved 2025-01-04
19. ↑ 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., II, A, 7, Stuttgart, Bad Cannstatt: Friedrich Frommann Verlag, p. 152, ISBN 3-7728-0466-7
20. ↑ Zenkin, Alexander (2004), "Logic Of Actual Infinity And G. Cantor's Diagonal Proof Of The Uncountability Of The Continuum", The Review of Modern Logic 9 (30): 27–80, http://projecteuclid.org/euclid.rml/1203431978, retrieved 2025-01-04
21. ↑ Dunham, William (1991). Journey through Genius: The Great Theorems of Mathematics. Penguin. p. 254. ISBN 9780140147391. https://archive.org/details/journeythroughge00dunh_359.
22. ↑ Riemann, Bernhard (1854). "Über die Hypothesen, welche der Geometrie zu Grunde liegen" (in en). https://www.cs.jhu.edu/~misha/ReadingSeminar/Papers/Riemann54.pdf.
23. ↑ Cantor, Georg (1874), "Ueber eine Eigenschaft des Inbegriffes aller reellen algebraischen Zahlen" (in de), Journal für die reine und angewandte Mathematik 1874 (77): 258–262, doi:10.1515/crll.1874.77.258, http://www.digizeitschriften.de/main/dms/img/?PPN=GDZPPN002155583, retrieved 2013-01-31
24. ↑ Johnson, Philip (1972), A History of Set Theory, Prindle, Weber & Schmidt, ISBN 0-87150-154-6, https://archive.org/details/historyofsettheo0000unse
25. ↑ Dauben, Joseph (1979), Georg Cantor: His Mathematics and Philosophy of the Infinite, Harvard University Press, pp. 30–54, ISBN 0-674-34871-0 .
26. ↑ The Mathematical Development of Set Theory for Cantor to Cohen Page 3
27. ↑ "Introduction to Sets". https://www.mathsisfun.com/sets/sets-introduction.html.
28. ↑ Kolmogorov, A.N.; Fomin, S.V. (1970), Introductory Real Analysis (Rev. English ed.), New York: Dover Publications, pp. 2–3, ISBN 0486612260, OCLC 1527264, https://archive.org/details/introductoryreal00kolm_0/page/2
29. ↑ "set theory | Basics, Examples, & Formulas" (in en). https://www.britannica.com/science/set-theory.
30. ↑ Kaplansky, Irving (1972). De Prima, Charles. ed (in en). Set Theory and Metric Spaces. Boston: Allyn and Bacon. p. 4.
31. ↑ Kaplansky, Irving (1972). De Prima, Charles. ed (in en). Set Theory and Metric Spaces. Boston: Allyn and Bacon. pp. 5–6.
32. ↑ Kaplansky, Irving (1972). De Prima, Charles. ed (in en). Set Theory and Metric Spaces. Boston: Allyn and Bacon. pp. 5–6.
33. ↑ Kaplansky, Irving (1972). De Prima, Charles. ed (in en). Set Theory and Metric Spaces. Boston: Allyn and Bacon. p. 19.
34. ↑ Bagaria, Joan (2020), Zalta, Edward N., ed., Set Theory (Spring 2020 ed.), Metaphysics Research Lab, Stanford University, https://plato.stanford.edu/archives/spr2020/entries/set-theory/, retrieved 2020-08-20
35. ↑ Forster, T. E. (2008). "The iterative conception of set". The Review of Symbolic Logic 1: 97–110. doi:10.1017/S1755020308080064. https://www.dpmms.cam.ac.uk/~tef10/iterativeconception.pdf.
36. ↑ Nelson, Edward (November 1977). "Internal Set Theory: a New Approach to Nonstandard Analysis". Bulletin of the American Mathematical Society 83 (6): 1165. doi:10.1090/S0002-9904-1977-14398-X.
37. ↑ "6.3: Equivalence Relations and Partitions" (in en). 2019-11-25. https://math.libretexts.org/Courses/Monroe_Community_College/MTH_220_Discrete_Math/6:_Relations/6.3:_Equivalence_Relations_and_Partitions.
38. ↑ "Order Relations and Functions". https://web.stanford.edu/class/archive/cs/cs103/cs103.1132/lectures/06/Slides06.pdf.
39. ↑ Mendelson, Elliott (1973), Number Systems and the Foundations of Analysis, Academic Press
40. ↑ "A PARTITION CALCULUS IN SET THEORY". https://www.ams.org/bull/1956-62-05/S0002-9904-1956-10036-0/S0002-9904-1956-10036-0.pdf.
41. ↑ 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, https://books.google.com/books?id=CZb-CAAAQBAJ&pg=PA642
42. ↑ Marquis, Jean-Pierre (August 29, 2019). "Category Theory". in Zalta, Edward N.. Metaphysics Research Lab, Stanford University. https://plato.stanford.edu/entries/category-theory/.
43. ↑ Awodey, Steve (2011). "From Sets to Types, to Categories, to Sets". in Sommaruga, Giovanni. Foundational Theories of Classical and Constructive Mathematics. The Western Ontario Series in Philosophy of Science. 76. Dordrecht: Springer. pp. 113–125. doi:10.1007/978-94-007-0431-2_5. ISBN 978-94-007-0430-5. https://link.springer.com/chapter/10.1007/978-94-007-0431-2_5.
44. ↑ Bishop, Errett (1967), Foundations of Constructive Analysis, New York: Academic Press, ISBN 4-87187-714-0, https://books.google.com/books?id=o2mmAAAAIAAJ
45. ↑ Feferman, Solomon (1998), In the Light of Logic, New York: Oxford University Press, pp. 280–283, 293–294, ISBN 0-195-08030-0, https://books.google.com/books?id=1rjnCwAAQBAJ
46. ↑ Rodych, Victor (Jan 31, 2018). "Wittgenstein's Philosophy of Mathematics". in Zalta, Edward N.. Stanford Encyclopedia of Philosophy (Spring 2018 ed.). https://plato.stanford.edu/entries/wittgenstein-mathematics/.
47. ↑ Wittgenstein, Ludwig (1975), Philosophical Remarks, §129, §174, Oxford: Basil Blackwell, ISBN 0-631-19130-5
48. ↑ Rodych 2018, §2.1: "When we prove a theorem or decide a proposition, we operate in a purely formal, syntactical manner. In doing mathematics, we do not discover pre-existing truths that were 'already there without one knowing' (PG 481)—we invent mathematics, bit-by-little-bit." Note, however, that Wittgenstein does not identify such deduction with philosophical logic; cf. Rodych §1, paras. 7-12.
49. ↑ Rodych 2018, §3.4: "Given that mathematics is a 'Template:Small caps of techniques of proof' (RFM III, §46), it does not require a foundation (RFM VII, §16) and it cannot be given a self-evident foundation (PR §160; WVC 34 & 62; RFM IV, §3). Since set theory was invented to provide mathematics with a foundation, it is, minimally, unnecessary."
50. ↑ Rodych 2018, §2.2: "An expression quantifying over an infinite domain is never a meaningful proposition, not even when we have proved, for instance, that a particular number n has a particular property."
51. ↑ Rodych 2018, §3.6.
52. ↑ Ferro, Alfredo; Omodeo, Eugenio G.; Schwartz, Jacob T. (September 1980), "Decision Procedures for Elementary Sublanguages of Set Theory. I. Multi-Level Syllogistic and Some Extensions", Communications on Pure and Applied Mathematics 33 (5): 599–608, doi:10.1002/cpa.3160330503
53. ↑ Cantone, Domenico; Ferro, Alfredo; Omodeo, Eugenio G. (1989), Computable Set Theory, International Series of Monographs on Computer Science, Oxford Science Publications, Oxford, UK: Clarendon Press, pp. xii, 347, ISBN 0-198-53807-3, https://archive.org/details/computablesetthe00cant/page/
54. ↑ Mac Lane, Saunders; Moerdijk, leke (1992), Sheaves in Geometry and Logic: A First Introduction to Topos Theory, Springer-Verlag, ISBN 978-0-387-97710-2, https://books.google.com/books?id=SGwwDerbEowC
55. ↑ homotopy type theory in nLab
56. ↑ Homotopy Type Theory: Univalent Foundations of Mathematics . The Univalent Foundations Program. Institute for Advanced Study.
57. ↑ Taylor, Melissa August, Harriet Barovick, Michelle Derrow, Tam Gray, Daniel S. Levy, Lina Lofaro, David Spitz, Joel Stein and Chris (14 June 1999). "The 100 Worst Ideas Of The Century" (in en). TIME. https://time.com/archive/6735628/the-100-worst-ideas-of-the-century/. Retrieved 12 April 2025.
58. ↑ Frank Ruda (6 October 2011). Hegel's Rabble: An Investigation into Hegel's Philosophy of Right. Bloomsbury Publishing. p. 151. ISBN 978-1-4411-7413-0. https://books.google.com/books?id=VV0SBwAAQBAJ&pg=PA151.
59. ↑ Adams, Stephen (October 1993). "Functional Pearls Efficient sets—a balancing act" (in en). Journal of Functional Programming 3 (4): 553–561. doi:10.1017/S0956796800000885. ISSN 1469-7653. https://www.cambridge.org/core/journals/journal-of-functional-programming/article/functional-pearls-efficient-setsa-balancing-act/0CAA1C189B4F7C15CE9B8C02D0D4B54E. Retrieved 12 April 2025.
60. ↑ Abbott, Stephen (2015) (in en). Understanding analysis (Second ed.). New York: Springer. p. 3. ISBN 978-1-4939-2711-1.

## References

* Kunen, Kenneth (1980), An Introduction to Independence Proofs, North-Holland, ISBN 0-444-85401-0
* Johnson, Philip (1972), A History of Set Theory, Prindle, Weber & Schmidt, ISBN 0-87150-154-6, https://archive.org/details/historyofsettheo0000unse

* Devlin, Keith (1993), The Joy of Sets: Fundamentals of Contemporary Set Theory, Undergraduate Texts in Mathematics (2nd ed.), Springer Verlag, doi:10.1007/978-1-4612-0903-4, ISBN 0-387-94094-4
* Ferreirós, Jose (2001), Labyrinth of Thought: A History of Set Theory and Its Role in Modern Mathematics, Berlin: Springer, ISBN 978-3-7643-5749-8, https://books.google.com/books?id=DITy0nsYQQoC
* Monk, J. Donald (1969), Introduction to Set Theory, McGraw-Hill Book Company, ISBN 978-0-898-74006-6, https://archive.org/details/introductiontose0000monk/page/n5/mode/2up
* Potter, Michael (2004), Set Theory and Its Philosophy: A Critical Introduction, Oxford University Press, ISBN 978-0-191-55643-2, https://books.google.com/books?id=FxRoPuPbGgUC
* Smullyan, Raymond M.; Fitting, Melvin (2010), Set Theory and the Continuum Problem, Dover Publications, ISBN 978-0-486-47484-7
* Tiles, Mary (2004), The Philosophy of Set Theory: An Historical Introduction to Cantor's Paradise, Dover Publications, ISBN 978-0-486-43520-6, https://books.google.com/books?id=02ASV8VB4gYC
* Dauben, Joseph W. (1977). "Georg Cantor and Pope Leo XIII: Mathematics, Theology, and the Infinite". Journal of the History of Ideas 38 (1): 85–108. doi:10.2307/2708842.
* Dauben, Joseph W. (1979). [Unavailable on archive.org Georg Cantor: his mathematics and philosophy of the infinite]. Boston: Harvard University Press. ISBN 978-0-691-02447-9. https://archive.org/details/georgcantorhisma0000daub.
* Kanamori, Akihiro (2003). The Higher Infinite (2nd ed.). Springer-Verlag. ISBN 978-3-540-88866-6.

## External links

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

|

* "Axiomatic set theory". EMS Press. https://encyclopediaofmath.org/wiki/Axiomatic_set_theory.
* Bagaria, Joan. "Set Theory". in Zalta, Edward N.. Metaphysics Research Lab, Stanford University. https://plato.stanford.edu/entries/set-theory/.
* Bell, John L.. "The Axiom of Choice". in Zalta, Edward N.. Metaphysics Research Lab, Stanford University. https://plato.stanford.edu/entries/axiom-choice/.
* Cunningham, Daniel. "Set Theory". https://iep.utm.edu/set-theo/.
* Ferreirós, José (2007). Labyrinth of Thought: A History of Set Theory and Its Role in Modern Mathematics (2nd ed.). Basel: Birkhäuser. ISBN 978-3-7643-8349-7.
* Foreman, Matthew; Kanamori, Akihiro, eds. "Handbook of Set Theory". Unofficial index maintained by Assaf Rinot. http://handbook.assafrinot.com/.
* Kennedy, Juliette. "Kurt Gödel". in Zalta, Edward N.. Metaphysics Research Lab, Stanford University. https://plato.stanford.edu/entries/goedel/.
* Koellner, Peter. "The Continuum Hypothesis". in Zalta, Edward N.. Metaphysics Research Lab, Stanford University. https://plato.stanford.edu/entries/continuum-hypothesis/.
* Koellner, Peter. "Large Cardinals and Determinacy". in Zalta, Edward N.. Metaphysics Research Lab, Stanford University. https://plato.stanford.edu/entries/large-cardinals-determinacy/.
* "Set theory". EMS Press. https://encyclopediaofmath.org/wiki/Set_theory.
* "Set Theory". https://ncatlab.org/nlab/show/set+theory.
* Weisstein, Eric W.. "Set Theory". Wolfram Research. https://mathworld.wolfram.com/SetTheory.html.
* "Zermelo–Fraenkel set theory". EMS Press. https://encyclopediaofmath.org/wiki/ZFC.

* v
* t
* e

Areas of mathematics

Foundations|

* Category theory
* Information theory
* Mathematical logic
* Philosophy of mathematics
* Set theory

Algebra|

* Abstract
* Elementary
* Linear
* Multilinear
* Universal

Analysis|

* Calculus
* Real analysis
* Complex analysis
* Differential equations
* Functional analysis
* Harmonic analysis

Discrete|

* Combinatorics
* Graph theory
* Order theory
* Game theory

Geometry|

* Algebraic
* Analytic
* Differential
* Discrete
* Euclidean
* Finite

Number theory|

* Arithmetic
* Algebraic number theory
* Analytic number theory
* Diophantine geometry

Topology|

* Algebraic
* Differential
* Geometric

Applied|

* Control theory
* Mathematical biology
* Mathematical chemistry
* Mathematical economics
* Mathematical finance
* Mathematical physics
* Mathematical psychology
* Mathematical statistics
* Probability
* Statistics

Computational|

* Computer science
* Theory of computation
* Numerical analysis
* Optimization
* Computer algebra

Others|

* History of mathematics
* Recreational mathematics
* Mathematics and art
* Mathematics education

* Category
* Portal
* Commons
* WikiProject

* v
* t
* e

Logic

* Outline
* History

Fields|

* Computer science
* Inference
* Philosophy of logic
* Proof
* Semantics
* Syntax

| Logics|

* Classical
* Informal
* Critical thinking
* Reason
* Mathematical
* Non-classical
* Philosophical

|

Theories|

* Argumentation
* Metalogic
* Metamathematics
* Set

Foundations|

* Abduction
* Analytic and synthetic propositions
* Contradiction
* Paradox
* Antinomy
* Deduction
* Deductive closure
* Definition
* Description
* Entailment
* Linguistic
* Form
* Induction
* Logical truth
* Name
* Necessity and sufficiency
* Premise
* Probability
* Reference
* Statement
* Substitution
* Truth
* Validity

Lists|

| topics|

* Mathematical logic
* Boolean algebra
* Set theory

|

other|

* Logicians
* Rules of inference
* Paradoxes
* Fallacies
* Logic symbols

*   * Category
* WikiProject (talk)
* changes

* v
* t
* e

Mathematical logic

General|

* 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

Systems|

* 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
and 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

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Set theory. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Set_theory&oldid=4409438"
*[c.]: circa
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template