References

  1. Luca Aceto, Antonis Achilleos, Adrian Francalanza & Anna Ingólfsdóttir (2020): The complexity of identifying characteristic formulae. J. Log. Algebraic Methods Program. 112, pp. 100529. Available at https://doi.org/10.1016/j.jlamp.2020.100529.
  2. Luca Alberucci & Alessandro Facchini (2009): The modal μ-calculus hierarchy over restricted classes of transition systems. The Journal of Symbolic Logic 74(4), pp. 1367–1400, doi:10.2178/jsl/1254748696.
  3. Luca Alberucci & Alessandro Facchini (2009): The modal μ-calculus hierarchy over restricted classes of transition systems. The Journal of Symbolic Logic 74(4), pp. 1367–1400, doi:10.2178/jsl/1254748696.
  4. Jon Barwise (1988): Three views of common knowledge. In: Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning About Knowledge, TARK '88. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp. 365–379. Available at http://dl.acm.org/citation.cfm?id=1029718.1029753.
  5. Patrick Blackburn, Johan van Benthem & Frank Wolter (2006): Handbook of Modal Logic. Studies in Logic and Practical Reasoning 3. Elsevier Science.
  6. Patrick Blackburn, Maarten de Rijke & Yde Venema (2001): Modal Logic. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, doi:10.1017/cbo9781107050884.
  7. Laura Bozzelli, Bastien Maubert & Sophie Pinchinat (2014): Unifying Hyper and Epistemic Temporal Logic abs/1409.2711, doi:10.1007/978-3-662-46678-0_11. ArXiv:1409.2711.
  8. Michael R. Clarkson & Fred B. Schneider (2010): Hyperproperties. Journal of Computer Security 18(6), pp. 1157–1210, doi:10.3233/JCS-2009-0393.
  9. Giovanna D'Agostino & Giacomo Lenzi (2013): On modal μ-calculus in S5 and applications. Fundamenta Informaticae 124(4), pp. 465–482, doi:10.3233/FI-2013-844.
  10. Giovanna D'Agostino & Giacomo Lenzi (2018): The μ-Calculus Alternation Depth Hierarchy is infinite over finite planar graphs. Theoretical Computer Science 737, pp. 40–61, doi:10.1016/j.tcs.2018.04.009. Available at https://www.sciencedirect.com/science/article/pii/S0304397518302317.
  11. Giovanna D’Agostino & Giacomo Lenzi (2010): On the μ-calculus over transitive and finite transitive frames. Theoretical Computer Science 411(50), pp. 4273–4290, doi:10.1016/j.tcs.2010.09.002. Available at https://www.sciencedirect.com/science/article/pii/S030439751000469X.
  12. Giovanna D’Agostino & Giacomo Lenzi (2015): On the modal μ-Calculus over finite symmetric graphs. Mathematica Slovaca 65(4), pp. 731–746, doi:10.1515/ms-2015-0052.
  13. E Allen Emerson, Charanjit S Jutla & A Prasad Sistla (2001): On model checking for the μ-calculus and its fragments. Theoretical Computer Science 258(1-2), pp. 491–522, doi:10.1016/S0304-3975(00)00034-7.
  14. Ronald Fagin, Joseph Y. Halpern, Yoram Moses & Moshe Y. Vardi (1995): Reasoning About Knowledge. The MIT Press, doi:10.7551/mitpress/5803.001.0001.
  15. Michael J. Fischer & Richard E. Ladner (1979): Propositional dynamic logic of regular programs. Journal of computer and system sciences 18(2), pp. 194–211, doi:10.1016/0022-0000(79)90046-1.
  16. Melvin Fitting (1972): Tableau methods of proof for modal logics.. Notre Dame Journal of Formal Logic 13(2), pp. 237–247, doi:10.1305/ndjfl/1093894722.
  17. Joseph Y. Halpern & Yoram Moses (1992): A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence 54(3), pp. 319–379, doi:10.1016/0004-3702(92)90049-4.
  18. Joseph Y. Halpern & Leandro Chaves Rêgo (2007): Characterizing the NP-PSPACE gap in the satisfiability problem for modal logic. Journal of Logic and Computation 17(4), pp. 795–806, doi:10.1093/logcom/exm029.
  19. Gilbert Harman (1977): Review of linguistic behavior by Jonathan Bennett. Language 53, pp. 417–424, doi:10.1353/lan.1977.0036.
  20. Marcin Jurdziński (1998): Deciding the winner in parity games is in UP co-UP. Information Processing Letters 68(3), pp. 119–124, doi:10.1016/S0020-0190(98)00150-1.
  21. Dexter Kozen (1983): Results on the propositional μ-calculus. Theoretical Computer Science 27(3), pp. 333–354, doi:10.1016/0304-3975(82)90125-6.
  22. 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.
  23. Elli Anastasiadi Adrian Francalanza Anna Ingólfsdóttir Luca Aceto, Antonis Achilleos: Complexity through Translations for Modal Logic with Recursion. Available at http://icetcs.ru.is/movemnt/papers/ComplexityTranslationsMLRecFullGand.pdf.
  24. Fabio Massacci (1994): Strongly analytic tableaux for normal modal logics. In: CADE, pp. 723–737, doi:10.1007/3-540-58156-1_52.
  25. Michael C. Nagle & S. K. Thomason (1985): The extensions of the modal logic K5. Journal of Symbolic Logic 50(1), pp. 102––109, doi:10.2307/2273793.
  26. Vaughan R. Pratt (1981): A decidable mu-calculus: Preliminary report. In: 22nd Annual Symposium on Foundations of Computer Science (SFCS 1981). IEEE, doi:10.1109/sfcs.1981.4.
  27. Mikhail Rybakov & Dmitry Shkatov (2018): Complexity of finite-variable fragments of propositional modal logics of symmetric frames. Logic Journal of the IGPL 27(1), pp. 60–68, doi:10.1093/jigpal/jzy018.
  28. Wieslaw Zielonka (1998): Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science 200(1-2), pp. 135–183, doi:10.1016/S0304-3975(98)00009-7.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org