Axiom of Determinacy

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 games of length ω with perfect information. AD states that every such game in which both players choose natural numbers is determined; that is, one of the two players has a winning strategy.

The axiom of determinacy is inconsistent with the axiom of choice (AC); the axiom of determinacy implies that all subsets of the real numbers are Lebesgue measurable, have the property of Baire, and the perfect set property. The last implies a weak form of the continuum hypothesis (namely, that every uncountable set of reals has the same cardinality as the full set of reals).

Furthermore, AD implies the consistency of Zermelo–Fraenkel set theory (ZF). Hence, as a consequence of the incompleteness theorems, it is not possible to prove the relative consistency of ZF + AD with respect to ZF.

Read more about Axiom Of Determinacy:  Types of Game That Are Determined, The Axiom of Choice and The Axiom of Determinacy Are Incompatible, Infinite Logic and The Axiom of Determinacy, Large Cardinals and The Axiom of Determinacy

Famous quotes containing the words axiom of and/or axiom:

    It’s an old axiom of mine: marry your enemies and behead your friends.
    —Robert N. Lee. Rowland V. Lee. King Edward IV (Ian Hunter)

    The writer who neglects punctuation, or mispunctuates, is liable to be misunderstood.... For the want of merely a comma, it often occurs that an axiom appears a paradox, or that a sarcasm is converted into a sermonoid.
    Edgar Allan Poe (1809–1845)