Studia Logica 75 (2):183-203 (2003)

Johan Van Benthem
University of Amsterdam
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 Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1027306910434
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 65,703
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Neighborhood Semantics for Modal Logic.Eric Pacuit - 2017 - Cham, Switzerland: Springer.
Extensive Games as Process Models.Johan van Benthem - 2002 - Journal of Logic, Language and Information 11 (3):289-313.
Generalized Quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.

View all 13 citations / Add more citations

Similar books and articles


Added to PP index

Total views
74 ( #148,987 of 2,462,499 )

Recent downloads (6 months)
1 ( #449,311 of 2,462,499 )

How can I increase my downloads?


My notes