Abstract
First we show that the classical two-player semantic game actually corresponds to a three-valued logic. Then we generalize this result and give an n-player semantic game for an n + 1-valued logic with n binary connectives, each associated with a player. We prove that player i has a winning strategy in game \({G(\varphi, M)}\) if and only if the truth value of \({\varphi}\) is t i in the model M, for 1 ≤ i ≤ n; and none of the players has a winning strategy in \({G(\varphi, M)}\) if and only if the truth value of \({\varphi}\) is t 0 in M.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Giles R. (1974). ‘A non-classical logic for physics’. Studia Logica 33: 399–417
Hintikka J. (1973). Logic, Language-Games and Information. Clarenden Press, Oxford
Kleene S.C. (1938). ‘On a notation for ordinal numbers’. Journal of Symbolic Logic 3: 150–155
Mundici D.(1992) ‘The logic of ulam’s game with lies’. In: Bicchieri C., Dalla Chiara M.L.(eds). Knowledge, Belief and Strategic Interaction. Cambridge University Press, Cambridge, pp 275–284
Mundici D. (1993). ‘Ulam games, Łukasiewicz logic and afc*-algebras’. Fund. Inform 18: 151–161
Osborne M.J. and Rubinstein A. (1994). A Course in Game Theory. The MIT Press, Cambridge, Mass
Väänänen J.(2007) ‘Team logic’, In: van Benthem J., Löwe B., Gabbay D. (eds). Interactive Logic, Texts in Logic and Games, vol. 1. Amsterdam University Press, Amsterdam, pp 281–302
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ju, S., Wen, X. An n-Player Semantic Game for an n + 1-Valued Logic. Stud Logica 90, 17–23 (2008). https://doi.org/10.1007/s11225-008-9141-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11225-008-9141-6