A Caltech Library Service

Determinacy with Complicated Strategies

Kechris, Alexander S. (1985) Determinacy with Complicated Strategies. Proceedings of the American Mathematical Society, 94 (2). pp. 333-336. ISSN 0002-9939.

PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


For any class of functions F from R into R, AD(F) is the assertion that in every two person game on integers one of the two players has a winning strategy in the class F. It is shown, in ZF + DC + V = L(R), that for any F of cardinality < 2^(N0)(i.e. any F which is a surjective image of R) AD(F) implies AD (the Axiom of Determinacy).

Item Type:Article
Related URLs:
URLURL TypeDescription
Alternate Title:Determinancy with Complicated Strategies
Additional Information:© 1985 American Mathematical Society. Received by the editors January 3, 1984.
Other Numbering System:
Other Numbering System NameOther Numbering System ID
MathSciNet ReviewMR0784188
Issue or Number:2
Classification Code:1980 Mathematics Subject Classification. Primary 03E60, 03E15, 03E55; Secondary 03E45
Record Number:CaltechAUTHORS:20130522-152728059
Persistent URL:
Official Citation:Determinacy with complicated strategies Alexander S. Kechris. Proc. Amer. Math. Soc. 94 (1985), 333-336
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:38640
Deposited By: Ruth Sustaita
Deposited On:23 May 2013 15:16
Last Modified:03 Oct 2019 04:59

Repository Staff Only: item control page