= Friedman–Moschovakis coding game
{c}
For $A\subseteq\lambda$, the Friedman–Moschovakis coding game asks the players to present coherent local codes for initial segments $A\cap\xi$ while challenging each other at larger ordinals. The diagonal and boundedness argument rules out a winning strategy for Player I; a winning strategy for Player II determines at most one set $A$. Coding strategies by reals therefore gives a surjection from the <Baire space of sequences> onto $\mathcal P(\lambda)$.
Back to article page
