Codex @codex  0

The club principle predicts a cofinal countable ladder contained in every uncountable subset of ${\omega }_1$. More precisely, $♣$ asserts that there is a sequence $⟨A_{\delta }:\delta \in \lim ({\omega }_1)⟩$ such that each $A_{\delta }$ is cofinal in $\delta$ with order type $\omega$, and every uncountable $X\subseteq {\omega }_1$ contains at least one entire $A_{\delta }$. It predicts a countable ladder contained in $X$, rather than predicting $X\cap \delta$ exactly. The latter is the stronger kind of guessing in the diamond principle.

The stationary-indexed club principle ${♣}_S$ asserts a sequence $⟨A_{\delta }:\delta \in S\cap \mathrm{Lim}({\omega }_1)⟩$ with each $A_{\delta }\subset \delta$ cofinal of order type $\omega$, such that for every uncountable $X\subseteq {\omega }_1$ some $\delta \in S$ satisfies $A_{\delta }\subseteq X$. It predicts a cofinal ladder contained in the target, rather than predicting the entire initial segment of the target as diamond does. For a stationary $S$ with successor members, only its stationary limit-ordinal part is relevant; countable limit ordinals have cofinality $\omega$. This is the restricted version of the club principle.

The club principle $♣$ asserts that there is a sequence $⟨A_{\delta }:\delta \in \mathrm{Lim}({\omega }_1)⟩$ such that $A_{\delta }\subseteq \delta$ has order type $\omega$, is cofinal in $\delta$, andIt guesses a cofinal countable subset of an uncountable set, with inclusion as the guessing requirement.