|
Organizers |
A dichotomy theorem for models of AD+
by
Richard Ketchersid
Boise State University
Coauthors: Andres Caicedo
We study the countable finite game under determinacy and show that in models of AD+ this game is undetermined. The proof uses a dichotomy theorem for sets in models of AD+, namely, every set is either well ordered or the reals embed into X. I will discuss this dichotomy and explain why it holds, a crucial part was recently answered by Hugh Woodin, and I will present hi contribution as well.
Date received: March 21, 2009
Copyright © 2009 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cayb-09.