The basic algebra of game equivalences (Q1425189)

In this paper, the author investigates game logic as introduced by \textit{R. Parikh} [Ann. Discrete Math. 24, 111--139 (1985; Zbl 0552.90110)]. The objects represented in game logic are games together with the operations \({}^d\) (swapping the two players' rôles), \(\vee\) (the first player may choose whether to play the left or the right game), \(\wedge\) (the second player may choose whether to play the left or the right game), and \(\circ\) (composition of games). Van Benthem (2000) gave a list of axioms and conjectured that they completely axiomatize the valid term identities in the described game language. The paper under review proves van Benthem's conjecture (Theorem 6). \textit{Y. Venema}'s paper [Stud. Log. 75, 239--256 (2003; Zbl 1038.03060)] is an algebraic companion to the paper under review and appeared in the same Studia Logica special issue on Game Logics and Game Algebras (edited by Marc Pauly and Rohit Parikh). In the companion paper, Venema improves Goranko's completeness theorem to a representation theorem.