The stationary set splitting game
From MaRDI portal
Publication:5387331
Abstract: The emph{stationary set splitting game} is a game of perfect information of length between two players, unspls and spl, in which unspls chooses stationarily many countable ordinals and spls 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 maximality with a predicate for the nonstationary ideal on , and an example of a consistently undetermined game of length with payoff definable 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.
Recommendations
Cites work
Cited in
(5)
This page was built for publication: The stationary set splitting game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387331)