 In two-step games like the above, where exactly one player wins (i.e., \(\win_A\leftrightarrow\neg\win_E\)), the latter formula expresses that either player E or player A has a winning strategy. More generally, this disjunctive assertion is a special case of Zermelo’s theorem, stating that every finite full information game is determined.