Representation of game algebras (Q1425190)

This paper is the algebraic companion to \textit{V. Goranko}'s paper [Stud. Log. 75, 221--238 (2003; Zbl 1038.03057)] (which appeared in the same Studia Logica special issue on Game Logics and Game Algebras edited by Marc Pauly and Rohit Parikh). The author defines a class of algebras called \textit{board algebras} corresponding to sets of games closed under the operations \(-\) (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 \(\diamond\) (composition of games). Van Benthem (2000) gave a list of axioms and conjectured that they completely axiomatize the valid term identities in all board algebras (Venema calls algebras that satisfy van Benthem's equations \textit{game algebras}). This conjecture has been proved by Goranko in his companion paper mentioned above. In this nicely written paper, the author improves Goranko's result by proving that every game algebra is isomorphic to a board algebra (Theorem 1). The paper is completely self-contained: In Section 3, the author gives all needed results about monotone operations in distributive lattices with full proofs.