 Expressing Nash equilibrium has served as a benchmark for logics of strategic games (van der Hoek &amp; Pauly 2007). Yet there are other desiderata, often connected to analyzing standard game-theoretic solution concepts for games. These are usually designed to find Nash equilibria or at least narrow down the strategy profiles to those compatible with certain requirements of rationality. Well-known methods of this kind are Backward Induction for extensive games and Iterated Removal of Strictly Dominated Strategies for strategic form games (Osborne &amp; Rubinstein 1994). These will be discussed now, as they raise intriguing further logical issues.