A presentation of Martin's proof of Borel determinacy, Part 2
Abstract:
Countably infinite games are, in general, not determined - there are games in which neither player has a winning strategy. A classical result of Martin shows that every game whose payoff set is Borel is determined. Recently Gowers proposed to use finite versions of the concepts involved in Martin's proof to solve the P vs. NP problem. Although it is not clear if this approach is likely to make a progress in the P vs. NP problem, it is worthwhile to recall Martin's proof.
CZ
