DECIDABILITY OF INDEPENDENCE-FRIENDLY MODAL LOGIC
暂无分享,去创建一个
[1] Wilfrid Hodges,et al. Compositional Semantics for a Language of Imperfect Information , 1997, Log. J. IGPL.
[2] Merlijn Sevenster,et al. Branches of imperfect information : logic, games, and computation , 2002 .
[3] P. van Emde Boas. The convenience of tiling , 1996 .
[4] Wilbur John Walkoe,et al. Finite Partially-Ordered Quantification , 1970, J. Symb. Log..
[5] J. Hintikka,et al. Game-Theoretical Semantics , 1997 .
[6] Johan van Benthem,et al. Handbook of Logic and Language , 1996 .
[7] Frank Wolter,et al. Handbook of Modal Logic , 2007, Studies in logic and practical reasoning.
[8] Merlijn Sevenster,et al. Model-theoretic and Computational Properties of Modal Dependence Logic , 2009, J. Log. Comput..
[9] Krzysztof R. Apt,et al. New Perspectives on Games and Interaction , 2008 .
[10] D. Harel. Recurring dominoes: making the highly undecidable highly understandable , 1985 .
[11] J.F.A.K. van Benthem,et al. Modal Correspondence Theory , 1977 .
[12] Ian Horrocks,et al. Computational modal logic , 2007, Handbook of Modal Logic.
[13] Theo M. V. Janssen,et al. Independent Choices and the Interpretation of IF Logic , 2002, J. Log. Lang. Inf..
[14] Patrick Blackburn,et al. Modal logic: a semantic perspective , 2007, Handbook of Modal Logic.
[15] Gabriel Sandu,et al. On the logic of informational independence and its applications , 1993, J. Philos. Log..
[16] Johan van Benthem,et al. Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..
[17] B. Russell. The Principles of Mathematics , 1938 .
[18] M. de Rijke,et al. Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.
[19] J. Reif,et al. Lower bounds for multiplayer noncooperative games of incomplete information , 2001 .
[20] Jaakko Hintikka,et al. Game-Theoretical Semantics , 1997, Handbook of Logic and Language.