ABSTRACT
We consider a logic for reasoning about composite strategies in games, where players’ strategies are like programs, composed structurally. These depend not only on conditions that hold at game positions but also on properties of other players’ strategies. We present an axiomatization for the logic and prove its completeness.
