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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Hintikka, J.: 1973,Logic, Language-Games and Information: Kantian Themes in the Philosophy of Logic, Oxford University Press, Oxford.
Hintikka, J. and G. Sandu: 1991,On the Methodology of Linguistics: A Case Study, Basil Blackwell, Oxford.
Luce, R. D., and H. Raiffa: 1957,Games and Decisions: Introduction and Critical Survey, John Wiley, New York.
Thomason, R. H.: 1970, ‘Indeterminist Time and Truth-Value Gaps’,Theoria 36, 264–81.
Thomason, R. H.: 1984, ‘Combinations of Tense and Modality’, in D. Gabbay and F. Guenthner (eds.),Handbook of Philosophical Logic, Vol. 2, D. Reidel, Dordrecht, pp. 135–65.
van Fraassen, B. C.: 1971,Formal Semantics and Logic, Macmillan, New York.
Author information
Authors and Affiliations
Additional information
The paper is a slightly revised version of the author's talk at the 7th Finnish-Russian Logic Colloquium, Helsinki-Turku, May 1992. I am grateful to Risto Hilpinen, Ilkka Niiniluoto, and, especially, Gabriel Sandu for their comments and discussion on these issues.
Rights and permissions
About this article
Cite this article
Blinov, A. Semantic games with chance moves. Synthese 99, 311–327 (1994). https://doi.org/10.1007/BF01063991
Issue Date:
DOI: https://doi.org/10.1007/BF01063991