 Equational axiomatizations for this game algebra can be found in Goranko (2003) and Venema (2003). However, following the analogy of propositional dynamic logic for an algebra of programs, there also is a dynamic game logic for this algebra of games, (Parikh 1985). It adds a modality \(\{G\}\varphi\) for each game G, with \(\{G\}\varphi\) expressing that in game G, the first player E has a strategy to force the truth of \(\varphi\). For the case of non-determined games, the language will be extended further to include separate modalities \(\{G, i\}\varphi\), one for each player i. Dynamic game logic shows in a perspicuous manner how strategic abilities for complex games supervene on abilities in simpler games. This is done by means of reduction laws such as