Large cardinalIn the mathematical field of set theory, a large cardinal property is a certain kind of property of transfinite cardinal numbers. Cardinals with such properties are, as the name suggests, generally very "large" (for example, bigger than the least α such that α=ωα). The proposition that such cardinals exist cannot be proved in the most common axiomatization of set theory, namely ZFC, and such propositions can be viewed as ways of measuring how "much", beyond ZFC, one needs to assume to be able to prove certain desired results.
Constructible universeIn mathematics, in set theory, the constructible universe (or Gödel's constructible universe), denoted by , is a particular class of sets that can be described entirely in terms of simpler sets. is the union of the constructible hierarchy . It was introduced by Kurt Gödel in his 1938 paper "The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis".
Von Neumann universeIn set theory and related branches of mathematics, the von Neumann universe, or von Neumann hierarchy of sets, denoted by V, is the class of hereditary well-founded sets. This collection, which is formalized by Zermelo–Fraenkel set theory (ZFC), is often used to provide an interpretation or motivation of the axioms of ZFC. The concept is named after John von Neumann, although it was first published by Ernst Zermelo in 1930. The rank of a well-founded set is defined inductively as the smallest ordinal number greater than the ranks of all members of the set.
Inner modelIn set theory, a branch of mathematical logic, an inner model for a theory T is a substructure of a model M of a set theory that is both a model for T and contains all the ordinals of M. Let be the language of set theory. Let S be a particular set theory, for example the ZFC axioms and let T (possibly the same as S) also be a theory in . If M is a model for S, and N is an -structure such that N is a substructure of M, i.e. the interpretation of in N is N is a model for T the domain of N is a transitive class of M N contains all ordinals of M then we say that N is an inner model of T (in M).
Aleph numberIn 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 the mathematician Georg Cantor and are named after the symbol he used to denote them, the Hebrew letter aleph (). The cardinality of the natural numbers is (read aleph-nought or aleph-zero; the term aleph-null is also sometimes used), the next larger cardinality of a well-ordered set is aleph-one then and so on.
Regular cardinalIn 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 . Infinite well-ordered cardinals that are not regular are called singular cardinals. Finite cardinal numbers are typically not called regular or singular. In the presence of the axiom of choice, any cardinal number can be well-ordered, and then the following are equivalent for a cardinal : is a regular cardinal.
Zermelo–Fraenkel set theoryIn set theory, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is an axiomatic system that was proposed in the early twentieth century in order to formulate a theory of sets free of paradoxes such as Russell's paradox. Today, Zermelo–Fraenkel set theory, with the historically controversial axiom of choice (AC) included, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics.
Measurable cardinalIn mathematics, a measurable cardinal is a certain kind of large cardinal number. In order to define the concept, one introduces a two-valued measure on a cardinal κ, or more generally on any set. For a cardinal κ, it can be described as a subdivision of all of its subsets into large and small sets such that κ itself is large, ∅ and all singletons , α ∈ κ are small, complements of small sets are large and vice versa. The intersection of fewer than κ large sets is again large.
Independence (mathematical logic)In mathematical logic, independence is the unprovability of a sentence from other sentences. A sentence σ is independent of a given first-order theory T if T neither proves nor refutes σ; that is, it is impossible to prove σ from T, and it is also impossible to prove from T that σ is false. Sometimes, σ is said (synonymously) to be undecidable from T; this is not the same meaning of "decidability" as in a decision problem. A theory T is independent if each axiom in T is not provable from the remaining axioms in T.
Club setIn mathematics, particularly in mathematical logic and set theory, a club set is a subset of a limit ordinal that is closed under the order topology, and is unbounded (see below) relative to the limit ordinal. The name club is a contraction of "closed and unbounded". Formally, if is a limit ordinal, then a set is closed in if and only if for every if then Thus, if the limit of some sequence from is less than then the limit is also in If is a limit ordinal and then is unbounded in if for any there is some such that If a set is both closed and unbounded, then it is a club set.
