David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 75 (2):183-203 (2003)
Game logics describe general games through powers of players for forcing outcomes. In particular, they encode an algebra of sequential game operations such as choice, dual and composition. Logic games are special games for specific purposes such as proof or semantical evaluation for first-order or modal languages. We show that the general algebra of game operations coincides with that over just logical evaluation games, whence the latter are quite general after all. The main tool in proving this is a representation of arbitrary games as modal or first-order evaluation games. We probe how far our analysis extends to product operations on games. We also discuss some more general consequences of this new perspective for standard logic.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Dietmar Berwanger (2003). Game Logic is Strong Enough for Parity Games. Studia Logica 75 (2):205 - 219.
Gabriel Sandu (1993). On the Logic of Informational Independence and its Applications. Journal of Philosophical Logic 22 (1):29 - 60.
Johan Van Benthem, Sujata Ghosh & Fenrong Liu (2008). Modelling Simultaneous Games in Dynamic Logic. Synthese 165 (2):247 - 268.
Johan van Benthem, Sujata Ghosh & Fenrong Liu (2008). Modelling Simultaneous Games in Dynamic Logic. Synthese 165 (2):247-268.
Johan Van Benthem (2003). Logic Games Are Complete for Game Logics. Studia Logica 75 (2):183 - 203.
Added to index2009-01-28
Total downloads9 ( #126,642 of 1,006,557 )
Recent downloads (6 months)0
How can I increase my downloads?