Semantic games with chance moves

Synthese 99 (3):311 - 327 (1994)
  Copy   BIBTEX

Abstract

In the presence of chance moves in a semantical game, the existence of pure optimal strategies does not guarantee the existence of winning ones. This fact provides a basis for constructing supervaluational semantical games with a chance move. Additional possibilities of using chance moves in game-theoretical semantics are also discussed.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,991

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
61 (#270,470)

6 months
9 (#356,105)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

What is categorical structuralism?Geoffrey Hellman - 2006 - In Johan van Benthem, Gerhard Heinzman, M. Rebushi & H. Visser (eds.), The Age of Alternative Logics. Springer. pp. 151--161.
Louis Joly as a Platonist Painter?Roger Pouivet - 2006 - In Johan van Benthem, Gerhard Heinzman, M. Rebushi & H. Visser (eds.), The Age of Alternative Logics. Springer. pp. 337--341.
Independence-friendly logic and games of incomplete information.Ahti-Veikko Pietarinen - 2006 - In Johan van Benthem, Gerhard Heinzman, M. Rebushi & H. Visser (eds.), The Age of Alternative Logics. Springer. pp. 243--259.

View all 6 citations / Add more citations