Abstract
This paper builds on a recent definition of concurrent games as event structures and an application giving a concurrent-game model for predicate calculus. An extension to concurrent games with imperfect information, through the introduction of ‘access levels’ to restrict the allowable strategies, leads to a concurrent-game semantics for a variant of Hintikka and Sandu’s Independence-Friendly (IF) logic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramsky, S., Jagadeesan, R.: Game semantics for access control. Electronic Notes in Theoretical Computer Science 249 (2009)
Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5) (2002)
Bradfield, J.C.: Independence: logics and concurrency. Acta Philosophica Fennica 78 (2006)
Bradfield, J.C., Fröschle, S.B.: Independence-friendly modal logic and true concurrency. Nord. J. Comput. 9(1) (2002)
Clairambault, P., Gutierrez, J., Winskel, G.: The winning ways of concurrent games. In: LICS. IEEE Comp. Soc. (2012)
Henkin, L.: Some remarks on infinitely long formulas. Infinitistic Methods (1961)
Hintikka, J., Sandu, G.: A revolution in logic? Nordic J. of Phil. Logic 1(2) (1996)
Hodges, W.: Compositional semantics for a language of imperfect information. Logic Journal of the IGPL 5(4) (1997)
Joyal, A.: Remarques sur la théorie des jeux à deux personnes. Gazette des sciences mathématiques du Québec 1(4) (1997)
Mann, A.L., Sandu, G., Sevenster, M.: Independence-Friendly Logic: A Game-Theoretic Approach. London Mathematical Society Lecture Note Series, vol. 386. Cambridge University Press (2011)
Martin, D.A.: The determinacy of blackwell games. The Journal of Symbolic Logic 63(4), 1565–1581 (1998)
Melliès, P.-A., Mimram, S.: Asynchronous games: innocence without alternation. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 395–411. Springer, Heidelberg (2007)
Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains. Theoretical Computer Science 13, 85–108 (1981)
Rideau, S., Winskel, G.: Concurrent strategies. In: LICS. IEEE Comp. Soc. (2011)
Väänänen, J.A.: Dependence Logic - A New Approach to Independence Friendly Logic. London Mathematical Society Student Texts, vol. 70. Cambridge University Press (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Clairambault, P., Gutierrez, J., Winskel, G. (2013). Imperfect Information in Logic and Concurrent Games. In: Coecke, B., Ong, L., Panangaden, P. (eds) Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky. Lecture Notes in Computer Science, vol 7860. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38164-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-38164-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38163-8
Online ISBN: 978-3-642-38164-5
eBook Packages: Computer ScienceComputer Science (R0)