On the -cub game on and I[]

The paper is concerned with the following two questions. (1) (Abraham and Shelah) Suppose \(\kappa\) is a regular infinite cardinal and \(S \subseteq \kappa^+\) is such that \(\{\alpha< \kappa^+: \text{cof} (\alpha)< \kappa \}\subseteq S\) and \(\{\alpha\in S:\text{cof}(\alpha)= \kappa \}\) is stationary in \(\kappa^+\). Is it then possible to add a closed unbounded subset of \(S\) by forcing so that \(\kappa^+\) remains regular and no bounded subsets of \(\kappa^+\) are added? (2) Suppose \(\kappa\) is a regular infinite cardinal and \(S\subseteq\kappa^+\) is such that II has a winning strategy in the following game of length \(\kappa\): At stage \(\alpha <\kappa\), I picks \(\beta_\alpha <\kappa^+\) with \(\beta_\alpha >\bigcup_{ \delta <\alpha} \gamma_\delta\), and II answers by choosing \(\gamma_\alpha < \kappa^+\) with \(\gamma_\alpha >\beta_\alpha\); II wins if and only if \(\bigcup_{\alpha <\kappa} \gamma_\alpha\in S\). Is there then a closed unbounded subset \(C\) of \(\kappa^+\) such that \(\{\alpha\in C:\text{cof} (\alpha)= \kappa\} \subseteq S?\) Reviewer's comment: Both questions were answered in 1987 by \textit{Hans-Dieter Donder} and \textit{Jean-Pierre Levinski} in their (unpublished) paper ``Stationary sets and game filters.

Recommendations

Cited in

(10)

This page was built for publication: On the \(\kappa\)-cub game on \(\lambda\) and \(I[\lambda]\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818433)