References

  1. Patrick Blackburn, Maarten de Rijke & Yde Venema (2001): Modal Logic. Cambridge University Press, New York, NY, USA, doi:10.1017/CBO9781107050884.
  2. Andreas Blass & Yuri Gurevich (1986): Henkin quantifiers and complete problems. Annals of Pure and Applied Logic 32, pp. 1 – 16, doi:10.1016/0168-0072(86)90040-0.
  3. Ivano Ciardelli & Floris Roelofsen (2011): Inquisitive Logic. Journal of Philosophical Logic 40(1), doi:10.1007/s10992-010-9142-6.
  4. Edmund M. Clarke, E. Allen Emerson & A. Prasad Sistla (1986): Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM T. Progr. Lang. Sys. 8(2), doi:10.1145/5397.5399.
  5. Stephen A. Cook (1971): The complexity of theorem-proving procedures. In: Proceedings of, STOC '71, pp. 151–158, doi:10.1145/800157.805047.
  6. Johannes Ebbing, Lauri Hella, Arne Meier, Julian-Steffen Müller, Jonni Virtema & Heribert Vollmer (2013): Extended Modal Dependence Logic. In: WoLLIC, pp. 126–137, doi:10.1007/978-3-642-39992-3_13.
  7. Johannes Ebbing & Peter Lohmann (2012): Complexity of Model Checking for Modal Dependence Logic.. In: SOFSEM, LNCS 7147. Springer, pp. 226–237, doi:10.1007/978-3-642-27660-6_19.
  8. Johannes Ebbing, Peter Lohmann & Fan Yang (2013): Model Checking for Modal Intuitionistic Dependence Logic. In: TbiLLC 2011, LNCS 7758. Springer, pp. 231–256, doi:10.1007/978-3-642-36976-6_15.
  9. Pietro Galliani (2013): The Dynamification of Modal Dependence Logic. Journal of Logic, Language and Information 22(3), pp. 269–295, doi:10.1007/s10849-013-9175-7.
  10. Erich Grädel (2013): Model-Checking Games for Logics of Incomplete Information. Theoretical Computer Science, Special Issue dedicated to GandALF 2011, pp. 2–14, doi:10.1016/j.tcs.2012.10.033.
  11. Jeroen Groenendijk (2007): Inquisitive Semantics: Two Possibilities for Disjunction.. In: TbiLLC 2007, LNCS 5422. Springer, pp. 80–94, doi:10.1007/978-3-642-00665-4_8.
  12. Lauri Hella, Kerkko Luosto, Katsuhiko Sano & Jonni Virtema (2014): The Expressive Power of Modal Dependence Logic. In: Advances in Modal Logic 2014. Available at http://arxiv.org/abs/1406.6266.
  13. Jaakko Hintikka & Gabriel Sandu (1989): Informational Independence as a Semantical Phenomenon. In: J. E. Fenstad, I. T. Frolov & R. Hilpinen: Logic, Methodology and Philosophy of Science 8. Elsevier, Amsterdam, pp. 571–589, doi:10.1007/978-94-017-2531-6_3.
  14. Wilfrid Hodges (1997): Compositional Semantics for a Language of Imperfect Information. Logic Journal of the IGPL 5(4), pp. 539–563, doi:10.1093/jigpal/5.4.539.
  15. Jarmo A. Kontinen (2010): Coherence and Complexity in Fragments of Dependence Logic. University of Amsterdam. Available at http://www.illc.uva.nl/Research/Publications/Dissertations/DS-2010-05.text.pdf.
  16. Juha Kontinen, Antti Kuusisto, Peter Lohmann & Jonni Virtema (2011): Complexity of Two-Variable Dependence Logic and IF-Logic. LICS '11. IEEE Computer Society, pp. 289–298, doi:10.1109/LICS.2011.14.
  17. Richard E. Ladner (1977): The Computational Complexity of Provability in Systems of Modal Propositional Logic. Siam Journal on Computing 6(3), pp. 467–480, doi:10.1137/0206033.
  18. Leonid A. Levin (1973): Universal search problems. Problems of Information Transmission 9(3).
  19. Peter Lohmann (2012): Computational Aspects of Dependence Logic. Leibniz Universität Hannover. Available at http://arxiv.org/abs/1206.4564.
  20. Peter Lohmann & Heribert Vollmer (2013): Complexity Results for Modal Dependence Logic. Studia Logica 101(2), pp. 343–366, doi:10.1007/s11225-013-9483-6.
  21. Julian-Steffen Müller & Heribert Vollmer (2013): Model Checking for Modal Dependence Logic: An Approach through Post's Lattice. In: WoLLIC 2013, pp. 238–250, doi:10.1007/978-3-642-39992-3_21.
  22. G. Peterson, J. Reif & S. Azhar (2001): Lower bounds for multiplayer noncooperative games of incomplete information. Comput. & Math. Appl. 41(7-8), pp. 957 – 992, doi:10.1016/S0898-1221(00)00333-3.
  23. Katsuhiko Sano (2011): First-Order Inquisitive Pair Logic. In: Mohua Banerjee & Anil Seth: 4th Indian Conference, ICLA 2011, LNCS 6521, pp. 147–161, doi:10.1007/978-3-642-18026-2_13.
  24. Merlijn Sevenster (2009): Model-theoretic and Computational Properties of Modal Dependence Logic. J. Log. Comput. 19(6), pp. 1157–1173, doi:10.1093/logcom/exn102.
  25. L. J. Stockmeyer & A. R. Meyer (1973): Word Problems Requiring Exponential Time(Preliminary Report). In: Proceedings of, STOC '73. ACM, New York, NY, USA, pp. 1–9, doi:10.1145/800125.804029.
  26. Jonni Virtema (2014): Approaches to Finite Variable Dependence: Expressiveness and Computational Complexity. University of Tampere. Available at http://urn.fi/URN:ISBN:978-951-44-9472-7.
  27. Jouko Väänänen (2007): Dependence Logic - A New Approach to Independence Friendly Logic. London Mathematical Society student texts 70. Cambridge University Press, doi:10.1017/CBO9780511611193.
  28. Jouko Väänänen (2008): Modal Dependence Logic. In: Krzysztof R. Apt & Robert van Rooij: New Perspectives on Games and Interaction, Texts in Logic and Games 4, pp. 237–254. Available at http://dare.uva.nl/document/130061.
  29. Fan Yang (2014): On Extensions and Variants of Dependence Logic. University of Helsinki. Available at http://www.math.helsinki.fi/logic/people/fan.yang/dissertation_fyang.pdf.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org