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