Abstract:

In this talk, we'll discuss the class of games which are countable intersections of countable unions of closed games, and present a proof of their determinacy. We will note that even though Martin's Borel Determinacy theorem includes this class of games, the proof we'll give can be carried out in a weaker theory than ZFC, and in fact, the determinacy of these games is nearing the limit of what can be proven using this weaker theory.

Event Date & Time:

January 30th, 3:45 P.M.