Antonio Montalban, University of California - Berkeley
Infinite two-player games have been a very useful tool to prove many results in logic and other areas. What makes them fascinating to computability theorists is that winning strategies can be extremely complex even for simple games.
We will describe these games, maybe play one or two, and introduce the necessary background to understand the answer---given by the author and Richard Shore---to the following question: How much determinacy of games can be proved without using uncountable objects?
This Public Lecture is part of the Workshop on Computability Theory and its Applications. The lecture is intended for a broad mathematical audience. A light reception will follow at 5 p.m.