Imperfect Information in Logic and Concurrent Games

  • Pierre Clairambault
  • Julian Gutierrez
  • Glynn Winskel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7860)


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.


Concurrent games Event structures IF logic 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abramsky, S., Jagadeesan, R.: Game semantics for access control. Electronic Notes in Theoretical Computer Science 249 (2009)Google Scholar
  2. 2.
    Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5) (2002)Google Scholar
  3. 3.
    Bradfield, J.C.: Independence: logics and concurrency. Acta Philosophica Fennica 78 (2006)Google Scholar
  4. 4.
    Bradfield, J.C., Fröschle, S.B.: Independence-friendly modal logic and true concurrency. Nord. J. Comput. 9(1) (2002)Google Scholar
  5. 5.
    Clairambault, P., Gutierrez, J., Winskel, G.: The winning ways of concurrent games. In: LICS. IEEE Comp. Soc. (2012)Google Scholar
  6. 6.
    Henkin, L.: Some remarks on infinitely long formulas. Infinitistic Methods (1961)Google Scholar
  7. 7.
    Hintikka, J., Sandu, G.: A revolution in logic? Nordic J. of Phil. Logic 1(2) (1996)Google Scholar
  8. 8.
    Hodges, W.: Compositional semantics for a language of imperfect information. Logic Journal of the IGPL 5(4) (1997)Google Scholar
  9. 9.
    Joyal, A.: Remarques sur la théorie des jeux à deux personnes. Gazette des sciences mathématiques du Québec 1(4) (1997)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Martin, D.A.: The determinacy of blackwell games. The Journal of Symbolic Logic 63(4), 1565–1581 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
    Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains. Theoretical Computer Science 13, 85–108 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Rideau, S., Winskel, G.: Concurrent strategies. In: LICS. IEEE Comp. Soc. (2011)Google Scholar
  15. 15.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Pierre Clairambault
    • 1
  • Julian Gutierrez
    • 2
  • Glynn Winskel
    • 1
  1. 1.Computer LaboratoryUniversity of CambridgeUK
  2. 2.Dept. of Computer ScienceUniversity of OxfordUK

Personalised recommendations