Games and Logic

Jacques Duparc

Institute of  Informatics
University of Lausanne - Switzerland

Bibliography:

1) P. Blackburn, M. de Rijke, and Y. Venema, Modal Logic. Cambridge University Press, 2001.
2) J. H. Conway, On numbers and games. Academic Press, 1976.
3) J. H. Conway and R. K. Guy The book of numbers. Copernicus, 1996.
4) K. Doets, Basic Model Theory. CSLI Stanford, 1996.
5) A. S. Kechris, Classical descriptive set theory. Springer, 1995.
6) M. J. Osborne and A. Rubinstein, A course in game theory. MIT Press, 1994.
7) C. Papadimitriou, Computational complexity. Addison-Wesley, 1994.
8) K. Ritzberger, Foundations of Non-Cooperative Game Theory. Oxford University Press, 2002.
9) J. van Benthem, Logic in games.

Lecture notes of a course tought at Stanford, 2001.

Game Theory is a very efficient tool for describing and analyzing many logical problems. The evaluation of a formula in a given model, the construction of homomorphisms between models, and even the description of computational complexity classes can all be described in a very natural way in terms of games. This short lecture presents the basic notions of Game Theory, from strategies to determinacy, and its applications to the ongoing "gamification" of logic.