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

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 105,030

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
79 (#284,802)

6 months
11 (#336,012)

Historical graph of downloads
How can I increase my downloads?