To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Axiom of projective determinacy

From Wikipedia, the free encyclopedia

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 two-player infinite game of perfect information of length ω in which the players play natural numbers, if the victory set (for either player, since the projective sets are closed under complementation) is projective, then one player or the other has a winning strategy.

The axiom is not a theorem of ZFC (assuming ZFC is consistent), but unlike the full axiom of determinacy (AD), which contradicts the axiom of choice, it is not known to be inconsistent with ZFC. PD follows from certain large cardinal axioms, such as the existence of infinitely many Woodin cardinals.

YouTube Encyclopedic

  • 1/3
    Views:
    28 275
    3 737
    1 793
  • The Continuum Hypothesis and the search for Mathematical Infinity, W. Hugh Woodin
  • Cantor’s Continuum Hypothesis Set Theory - W. H. Woodin - 2/23/2019
  • MM70 - Hugh Woodin - Formulating the axiom V = Ultimate L

Transcription

Consequences

PD implies that all projective sets are Lebesgue measurable (in fact, universally measurable) and have the perfect set property and the property of Baire. It also implies that every projective binary relation may be uniformized by a projective set.

PD implies that for all positive integers , there is a largest countable set.[1]

References

  • Martin, Donald A.; Steel, John R. (Jan 1989). "A Proof of Projective Determinacy". Journal of the American Mathematical Society. 2 (1): 71–125. doi:10.2307/1990913. JSTOR 1990913.
  • Moschovakis, Yiannis N. (2009). Descriptive set theory (PDF) (2nd ed.). Providence, R.I.: American Mathematical Society. ISBN 978-0-8218-4813-5. Archived from the original on 2014-11-12.{{cite book}}: CS1 maint: bot: original URL status unknown (link)

Citations

  1. ^ Donald A. Martin, "The largest countable this, that, and the other". Cabal seminar 79–81, Proceedings, Caltech-UCLA Logic Seminar 1979–81, edited by A. S. Kechris, D. A. Martin, and Y. N. Moschovakis, Lecture notes in mathematics, vol. 1019, Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1983, pp. 97–106.


This page was last edited on 4 March 2024, at 06:02
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.