Abstract

The stationary set splitting game is a game of perfect information of length ω1 between two players, unsplit and split, in which unsplit chooses stationarily many countable ordinals and split tries to continuously divide them into two stationary pieces. We show that it is possible in ZFC to force a winning strategy for either player, or for neither. This gives a new counterexample to Σ22 maximality with a predicate for the nonstationary ideal on ω1, and an example of a consistently undetermined game of length ω1 with payoff de.nable in the second-order monadic logic of order. We also show that the determinacy of the game is consistent with Martin's Axiom but not Martin's Maximum