The stationary set splitting game

From MaRDI portal
Publication:5387331

DOI10.1002/MALQ.200610054zbMATH Open1140.03035arXiv1003.2425OpenAlexW1995039725MaRDI QIDQ5387331FDOQ5387331


Authors: S. Shelah, Paul Larson Edit this on Wikidata


Publication date: 8 May 2008

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Abstract: The emph{stationary set splitting game} is a game of perfect information of length omega1 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 Sigma22 maximality with a predicate for the nonstationary ideal on omega1, and an example of a consistently undetermined game of length omega1 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.


Full work available at URL: https://arxiv.org/abs/1003.2425




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)