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 games of length ω. AD states that every game of a certain type is determined; that is, one of the two players has a winning strategy.
Steinhaus and Mycielski's motivation for AD was its interesting consequences, and suggested that AD could be true in the smallest natural model L(R) of a set theory, which accepts only a weak form of the axiom of choice (AC) but contains all real and all ordinal numbers. Some consequences of AD followed from theorems proved earlier by Stefan Banach and Stanisław Mazur, and Morton Davis. Mycielski and Stanisław Świerczkowski contributed another one: AD implies that all sets of real numbers are Lebesgue measurable. Later Donald A. Martin and others proved more important consequences, especially in descriptive set theory. In 1988, John R. Steel and W. Hugh Woodin concluded a long line of research. Assuming the existence of some uncountable cardinal numbers analogous to ℵ0, they proved the original conjecture of Mycielski and Steinhaus that AD is true in L(R).
and 22 Related for: Axiom of determinacy information
In mathematics, the axiomofdeterminacy (abbreviated as AD) is a possible axiom for set theory introduced by Jan Mycielski and Hugo Steinhaus in 1962...
projective determinacy is the special case of the axiomofdeterminacy applying only to projective sets. The axiomof projective determinacy, abbreviated...
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...
In mathematics, the axiomof real determinacy (abbreviated as ADR) is an axiom in set theory. It states the following: Axiom — Consider infinite two-person...
determinacy Von Neumann–Bernays–Gödel axioms Continuum hypothesis and its generalization Freiling's axiomof symmetry AxiomofdeterminacyAxiomof projective...
the axiom of determinacy. The axiomof choice is avoided in some varieties of constructive mathematics, although there are varieties of constructive mathematics...
study of inner models is common in the study ofdeterminacy and large cardinals, especially when considering axioms such as the axiomofdeterminacy that...
proof of the theorem in Zermelo–Fraenkel set theory must make repeated use of the axiomof replacement. Later results showed that stronger determinacy theorems...
the set of Liouville numbers are examples of uncountable sets that have Lebesgue measure 0. If the axiomofdeterminacy holds then all sets of reals are...
levels of the Borel hierarchy and the difference hierarchy. The Wadge hierarchy plays an important role in models of the axiomofdeterminacy. Further...
therefore the negation of the axiomofdeterminacy, AD), so choice and GCH are not independent in ZF; there are no models of ZF in which GCH holds and...
is a filter on the set of Turing degrees of sets of natural numbers, named after Donald A. Martin. Under the axiomofdeterminacy it can be shown to be...
of axiomatic set theory, the axiom schema of specification, also known as the axiom schema of separation (Aussonderung Axiom), subset axiom or axiom schema...
of mathematics and philosophy that use it, the axiomof infinity is one of the axiomsof Zermelo–Fraenkel set theory. It guarantees the existence of at...
set theory, the axiom schema of replacement is a schema ofaxioms in Zermelo–Fraenkel set theory (ZF) that asserts that the image of any set under any...
In mathematics, the axiomof regularity (also known as the axiomof foundation) is an axiomof Zermelo–Fraenkel set theory that states that every non-empty...
is that the axiomofdeterminacy holds in L(R), the smallest inner model containing the real numbers. Another consequence is the failure of square principles...
program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. Its defining method can briefly be described...