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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,561

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
69 (#297,128)

6 months
7 (#655,041)

Historical graph of downloads
How can I increase my downloads?