Published June 1985
| Published
Journal Article
Open
Determinacy with Complicated Strategies
- Creators
-
Kechris, Alexander S.
Abstract
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).
Additional Information
© 1985 American Mathematical Society. Received by the editors January 3, 1984.Attached Files
Published - 2045400.pdf
Files
2045400.pdf
Files
(147.1 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:b86e2d402e5631828dd5a4c9e160ddab
|
147.1 kB | Preview Download |
Additional details
- Alternative title
- Determinancy with Complicated Strategies
- Eprint ID
- 38640
- Resolver ID
- CaltechAUTHORS:20130522-152728059
- Created
-
2013-05-23Created from EPrint's datestamp field
- Updated
-
2023-06-01Created from EPrint's last_modified field