Θ (set theory)
In set theory, Θ (pronounced like the letter theta) is the least nonzero ordinal α such that there is no surjection from the reals onto α. If the axiom of choice (AC) holds (or even if the reals can b
Cardinal and Ordinal Numbers
Cardinal and Ordinal Numbers is a book on transfinite numbers, by Polish mathematician Wacław Sierpiński. It was published in 1958 by Państwowe Wydawnictwo Naukowe, as volume 34 of the series Monograf
Countable set
In mathematics, a set is countable if either it is finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is countable if there exists an injective
Hartogs number
In mathematics, specifically in axiomatic set theory, a Hartogs number is an ordinal number associated with a set. In particular, if X is any set, then the Hartogs number of X is the least ordinal α s
Finite set
In mathematics, particularly set theory, a finite set is a set that has a finite number of elements. Informally, a finite set is a set which one could in principle count and finish counting. For examp
Infinite set
In set theory, an infinite set is a set that is not a finite set. Infinite sets may be countable or uncountable.
Cardinal characteristic of the continuum
In the mathematical discipline of set theory, a cardinal characteristic of the continuum is an infinite cardinal number that may consistently lie strictly between (the cardinality of the set of natura
Beth number
In mathematics, particularly in set theory, the beth numbers are a certain sequence of infinite cardinal numbers (also known as transfinite numbers), conventionally written , where is the second Hebre
Limit cardinal
In mathematics, limit cardinals are certain cardinal numbers. A cardinal number λ is a weak limit cardinal if λ is neither a successor cardinal nor zero. This means that one cannot "reach" λ from anot
König's theorem (set theory)
In set theory, König's theorem states that if the axiom of choice holds, I is a set, and are cardinal numbers for every i in I, and for every i in I, then The sum here is the cardinality of the disjoi
Uncountable set
In mathematics, an uncountable set (or uncountably infinite set) is an infinite set that contains too many elements to be countable. The uncountability of a set is closely related to its cardinal numb
Suslin cardinal
In mathematics, a cardinal λ < Θ is a Suslin cardinal if there exists a set P ⊂ 2ω such that P is λ-Suslin but P is not λ'-Suslin for any λ' < λ. It is named after the Russian mathematicianMikhail Yak
Regular cardinal
In set theory, a regular cardinal is a cardinal number that is equal to its own cofinality. More explicitly, this means that is a regular cardinal if and only if every unbounded subset has cardinality
Cichoń's diagram
In set theory, Cichoń's diagram or Cichon's diagram is a table of 10 infinite cardinal numbers related to the set theory of the reals displaying the provable relations between these cardinal character
Tarski's theorem about choice
In mathematics, Tarski's theorem, proved by Alfred Tarski, states that in ZF the theorem "For every infinite set , there is a bijective map between the sets and " implies the axiom of choice. The oppo
Cardinality of the continuum
In set theory, the cardinality of the continuum is the cardinality or "size" of the set of real numbers , sometimes called the continuum. It is an infinite cardinal number and is denoted by (lowercase
Transfinite number
In mathematics, transfinite numbers are numbers that are "infinite" in the sense that they are larger than all finite numbers, yet not necessarily absolutely infinite. These include the transfinite ca
Von Neumann cardinal assignment
The von Neumann cardinal assignment is a cardinal assignment that uses ordinal numbers. For a well-orderable set U, we define its cardinal number to be the smallest ordinal number equinumerous to U, u
Successor cardinal
In set theory, one can define a successor operation on cardinal numbers in a similar way to the successor operation on the ordinal numbers. The cardinal successor coincides with the ordinal successor
Singular cardinals hypothesis
In set theory, the singular cardinals hypothesis (SCH) arose from the question of whether the least cardinal number for which the generalized continuum hypothesis (GCH) might fail could be a singular
Dedekind-infinite set
In mathematics, a set A is Dedekind-infinite (named after the German mathematician Richard Dedekind) if some proper subset B of A is equinumerous to A. Explicitly, this means that there exists a bijec
Natural number
In mathematics, the natural numbers are those numbers used for counting (as in "there are six coins on the table") and ordering (as in "this is the third largest city in the country"). Numbers used fo
Cardinal number
In mathematics, cardinal numbers, or cardinals for short, are a generalization of the natural numbers used to measure the cardinality (size) of sets. The cardinality of a finite set is a natural numbe
Continuum hypothesis
In mathematics, the continuum hypothesis (abbreviated CH) is a hypothesis about the possible sizes of infinite sets. It states that there is no set whose cardinality is strictly between that of the in
Cardinal assignment
In set theory, the concept of cardinality is significantly developable without recourse to actually defining cardinal numbers as objects in the theory itself (this is in fact a viewpoint taken by Freg
Amorphous set
In set theory, an amorphous set is an infinite set which is not the disjoint union of two infinite subsets.
Cantor's theorem
In mathematical set theory, Cantor's theorem is a fundamental result which states that, for any set , the set of all subsets of the power set of has a strictly greater cardinality than itself. For fin
Continuum function
In mathematics, the continuum function is , i.e. raising 2 to the power of κ using cardinal exponentiation. Given a cardinal number, it is the cardinality of the power set of a set of the given cardin
Cardinal function
In mathematics, a cardinal function (or cardinal invariant) is a function that returns cardinal numbers.
Aleph number
In mathematics, particularly in set theory, the aleph numbers are a sequence of numbers used to represent the cardinality (or size) of infinite sets that can be well-ordered. They were introduced by t
Strong partition cardinal
In Zermelo–Fraenkel set theory without the axiom of choice a strong partition cardinal is an uncountable well-ordered cardinal such that every partition of the set of size subsets of into less than pi
Schröder–Bernstein theorem
In set theory, the Schröder–Bernstein theorem states that, if there exist injective functions f : A → B and g : B → A between the sets A and B, then there exists a bijective function h : A → B. In ter
Tav (number)
In his work on set theory, Georg Cantor denoted the collection of all cardinal numbers by the last letter of the Hebrew alphabet, ת (transliterated as Tav, Taw, or Sav.) As Cantor realized, this colle
Easton's theorem
In set theory, Easton's theorem is a result on the possible cardinal numbers of powersets. (extending a result of Robert M. Solovay) showed via forcing that the only constraints on permissible values
Cantor's paradox
In set theory, Cantor's paradox states that there is no set of all cardinalities. This is derived from the theorem that there is no greatest cardinal number. In informal terms, the paradox is that the
Rathjen's psi function
In mathematics, Rathjen's psi function is an ordinal collapsing function developed by Michael Rathjen. It collapses weakly Mahlo cardinals to generate large countable ordinals. A weakly Mahlo cardinal
Equinumerosity
In mathematics, two sets or classes A and B are equinumerous if there exists a one-to-one correspondence (or bijection) between them, that is, if there exists a function from A to B such that for ever
Cardinality
In mathematics, the cardinality of a set is a measure of the number of elements of the set. For example, the set contains 3 elements, and therefore has a cardinality of 3. Beginning in the late 19th c
Cantor's diagonal argument
In set theory, Cantor's diagonal argument, also called the diagonalisation argument, the diagonal slash argument, the anti-diagonal argument, the diagonal method, and Cantor's diagonalization proof, w
Gimel function
In axiomatic set theory, the gimel function is the following function mapping cardinal numbers to cardinal numbers: where cf denotes the cofinality function; the gimel function is used for studying th
Cofinality
In mathematics, especially in order theory, the cofinality cf(A) of a partially ordered set A is the least of the cardinalities of the cofinal subsets of A. This definition of cofinality relies on the