Θ (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
Axiom of real determinacy
In mathematics, the axiom of real determinacy (abbreviated as ADR) is an axiom in set theory. It states the following: Axiom — Consider infinite two-person games with perfect information. Then, every
Axiom of projective determinacy
In mathematical logic, projective determinacy is the special case of the axiom of determinacy applying only to projective sets. The axiom of projective determinacy, abbreviated PD, states that for any
Measurable cardinal
In 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
Zero sharp
In the mathematical discipline of set theory, 0# (zero sharp, also 0#) is the set of true formulae about indiscernibles and order-indiscernibles in the Gödel constructible universe. It is often encode
Rank-into-rank
In set theory, a branch of mathematics, a rank-into-rank embedding is a large cardinal property defined by one of the following four axioms given in order of increasing consistency strength. (A set of
Universally measurable set
In mathematics, a subset of a Polish space is universally measurable if it is measurable with respect to every complete probability measure on that measures all Borel subsets of . In particular, a uni
Borel determinacy theorem
In descriptive set theory, the Borel determinacy theorem states that any Gale–Stewart game whose payoff set is a Borel set is determined, meaning that one of the two players will have a winning strate
Woodin cardinal
In set theory, a Woodin cardinal (named for W. Hugh Woodin) is a cardinal number such that for all functions there exists a cardinal with and an elementary embedding from the Von Neumann universe into
Banach–Mazur game
In general topology, set theory and game theory, a Banach–Mazur game is a topological game played by two players, trying to pin down elements in a set (space). The concept of a Banach–Mazur game is cl
Lightface analytic game
In descriptive set theory, a lightface analytic game is a game whose payoff set A is a subset of Baire space; that is, there is a tree T on which is a computable subset of , such that A is the project
Homogeneous tree
In descriptive set theory, a tree over a product set is said to be homogeneous if there is a system of measures such that the following conditions hold:
* is a countably-additive measure on .
* The
Homogeneously Suslin set
In descriptive set theory, a set is said to be homogeneously Suslin if it is the projection of a homogeneous tree. is said to be -homogeneously Suslin if it is the projection of a -homogeneous tree. I
AD+
In set theory, AD+ is an extension, proposed by W. Hugh Woodin, to the axiom of determinacy. The axiom, which is to be understood in the context of ZF plus DCR (the axiom of dependent choice for real
Determinacy
Determinacy is a subfield of set theory, a branch of mathematics, that examines the conditions under which one or the other player of a game has a winning strategy, and the consequences of the existen
Tree (descriptive set theory)
In descriptive set theory, a tree on a set is a collection of finite sequences of elements of such that every prefix of a sequence in the collection also belongs to the collection.
Axiom of determinacy
In mathematics, the axiom of determinacy (abbreviated as AD) is a possible axiom for set theory introduced by Jan Mycielski and Hugo Steinhaus in 1962. It refers to certain two-person topological game
L(R)
In set theory, L(R) (pronounced L of R) is the smallest transitive inner model of ZF containing all the ordinals and all the reals.
Property of Baire
A subset of a topological space has the property of Baire (Baire property, named after René-Louis Baire), or is called an almost open set, if it differs from an open set by a meager set; that is, if t
Moschovakis coding lemma
The Moschovakis coding lemma is a lemma from descriptive set theory involving sets of real numbers under the axiom of determinacy (the principle — incompatible with choice — that every two-player inte
Martin measure
In descriptive set theory, the Martin measure is a filter on the set of Turing degrees of sets of natural numbers, named after Donald A. Martin. Under the axiom of determinacy it can be shown to be an