Document Open Access Logo

Canonical Models and the Complexity of Modal Team Logic

Author Martin Lück

Thumbnail PDF


  • Filesize: 0.58 MB
  • 23 pages

Document Identifiers

Author Details

Martin Lück
  • Institut für Theoretische Informatik, Leibniz Universität Hannover, Appelstraße 4, 30167 Hannover, Germany

Cite AsGet BibTex

Martin Lück. Canonical Models and the Complexity of Modal Team Logic. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 30:1-30:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)


We study modal team logic MTL, the team-semantical extension of classical modal logic closed under Boolean negation. Its fragments, such as modal dependence, independence, and inclusion logic, are well-understood. However, due to the unrestricted Boolean negation, the satisfiability problem of full MTL has been notoriously resistant to a complexity theoretical classification. In our approach, we adapt the notion of canonical models for team semantics. By construction of such a model, we reduce the satisfiability problem of MTL to simple model checking. Afterwards, we show that this method is optimal in the sense that MTL-formulas can efficiently enforce canonicity. Furthermore, to capture these results in terms of computational complexity, we introduce a non-elementary complexity class, TOWER(poly), and prove that the satisfiability and validity problem of MTL are complete for it. We also show that the fragments of MTL with bounded modal depth are complete for the levels of the elementary hierarchy (with polynomially many alternations).

Subject Classification

ACM Subject Classification
  • Theory of computation → Complexity theory and logic
  • Theory of computation → Logic
  • team semantics
  • modal logic
  • complexity
  • satisfiability


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Samson Abramsky, Juha Kontinen, Jouko Väänänen, and Heribert Vollmer, editors. Dependence Logic, Theory and Applications. Springer, 2016. URL:
  2. Patrick Blackburn, Maarten de Rijke, and Yde Venema. Modal logic. Cambridge University Press, New York, NY, USA, 2001. Google Scholar
  3. Ashok K. Chandra, Dexter C. Kozen, and Larry J. Stockmeyer. Alternation. J. ACM, 28(1):114-133, 1981. URL:
  4. Kevin J. Compton and C. Ward Henson. A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories. Ann. Pure Appl. Logic, 48(1):1-79, 1990. URL:
  5. Stephen A. Cook. The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, pages 151-158, 1971. URL:
  6. Arnaud Durand, Juha Kontinen, and Heribert Vollmer. Expressivity and Complexity of Dependence Logic, pages 5-32. Springer International Publishing, 2016. URL:
  7. Pietro Galliani. Inclusion and exclusion dependencies in team semantics - on some logics of imperfect information. Ann. Pure Appl. Logic, 163(1):68-84, 2012. URL:
  8. Pietro Galliani. Upwards closed dependencies in team semantics. Information and Computation, 245:124-135, 2015. URL:
  9. Erich Grädel and Jouko Väänänen. Dependence and independence. Studia Logica, 101(2):399-410, 2013. URL:
  10. Miika Hannula. Validity and entailment in modal and propositional dependence logics. CoRR, abs/1608.04301, 2016. URL:
  11. Miika Hannula. Validity and Entailment in Modal and Propositional Dependence Logics. In 26th EACSL Annual Conference on Computer Science Logic (CSL 2017), volume 82 of Leibniz International Proceedings in Informatics (LIPIcs), pages 28:1-28:17. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017. URL:
  12. Miika Hannula, Juha Kontinen, Martin Lück, and Jonni Virtema. On Quantified Propositional Logics and the Exponential Time Hierarchy. In Proceedings of the Seventh International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2016, pages 198-212, 2016. URL:
  13. Miika Hannula, Juha Kontinen, Jonni Virtema, and Heribert Vollmer. Complexity of propositional independence and inclusion logic. In Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, pages 269-280, 2015. URL:
  14. Miika Hannula, Juha Kontinen, Jonni Virtema, and Heribert Vollmer. Complexity of Propositional Logics in Team Semantic. ACM Transactions on Computational Logic, 19(1):1-14, jan 2018. URL:
  15. Lauri Hella, Antti Kuusisto, Arne Meier, and Jonni Virtema. Model checking and validity in propositional and modal inclusion logics. In 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, pages 32:1-32:14, 2017. URL:
  16. Lauri Hella, Antti Kuusisto, Arne Meier, and Heribert Vollmer. Modal Inclusion Logic: Being Lax is Simpler than Being Strict. In Mathematical Foundations of Computer Science 2015, volume 9234, pages 281-292. Springer Berlin Heidelberg, 2015. URL:
  17. Lauri Hella, Kerkko Luosto, Katsuhiko Sano, and Jonni Virtema. The expressive power of modal dependence logic. In Advances in Modal Logic 10, invited and contributed papers from the tenth conference on "Advances in Modal Logic". Groningen, The Netherlands, August 5-8, 2014, pages 294-312, 2014. URL:
  18. Lauri Hella and Johanna Stumpf. The expressive power of modal logic with inclusion atoms. Electronic Proceedings in Theoretical Computer Science, 193:129-143, 2015. URL:
  19. Jaakko Hintikka and Gabriel Sandu. Informational Independence as a Semantical Phenomenon. In Jens Erik Fenstad, Ivan T. Frolov, and Risto Hilpinen, editors, Logic, Methodology and Philosophy of Science VIII, volume 126 of Studies in Logic and the Foundations of Mathematics, pages 571-589. Elsevier, 1989. URL:
  20. Wilfrid Hodges. Compositional semantics for a language of imperfect information. Logic Journal of IGPL, 5(4):539-563, 1997. URL:
  21. M. Jonáš and J. Strejček. On the complexity of the quantified bit-vector arithmetic with binary encoding. Information Processing Letters, 2018. URL:
  22. Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, and Heribert Vollmer. A Van Benthem theorem for modal team semantics. In 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany, pages 277-291, 2015. URL:
  23. Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, and Heribert Vollmer. Modal independence logic. Journal of Logic and Computation, 27(5):1333-1352, 2017. URL:
  24. Juha Kontinen and Ville Nurmi. Team logic and second-order logic. Fundam. Inform., 106(2-4):259-272, 2011. URL:
  25. Andreas Krebs, Arne Meier, and Jonni Virtema. A team based variant of CTL. In 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, pages 140-149, 2015. URL:
  26. Peter Lohmann and Heribert Vollmer. Complexity results for modal dependence logic. Studia Logica, 101(2):343-366, 04 2013. URL:
  27. Martin Lück. Axiomatizations for propositional and modal team logic. In 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, pages 33:1-33:18, 2016. URL:
  28. Martin Lück. The power of the filtration technique for modal logics with team semantics. In 26th EACSL Annual Conference on Computer Science Logic, CSL 2017, pages 31:1-31:20, 2017. URL:
  29. Martin Lück. On the complexity of team logic and its two-variable fragment. MFCS 2018. To appear. Google Scholar
  30. Martin Lück. Canonical models and the complexity of modal team logic. CoRR, abs/1709.05253, 2017. URL:
  31. Julian-Steffen Müller. Satisfiability and model checking in team based logics. PhD thesis, University of Hanover, 2014. URL:
  32. Sylvain Schmitz. Complexity hierarchies beyond elementary. TOCT, 8(1):3:1-3:36, 2016. URL:
  33. Merlijn Sevenster. Model-theoretic and computational properties of modal dependence logic. J. Log. Comput., 19(6):1157-1173, 2009. URL:
  34. Larry J. Stockmeyer and Albert R. Meyer. Word Problems Requiring Exponential Time: Preliminary Report. In Proceedings of the 5th Annual ACM Symposium on Theory of Computing, pages 1-9, 1973. URL:
  35. Jouko Väänänen. Modal dependence logic. New perspectives on games and interaction, 4:237-254, 2008. Google Scholar
  36. Jonni Virtema. Complexity of validity for propositional dependence logics. Inf. Comput., 253:224-236, 2017. URL:
  37. Marco Voigt. A fine-grained hierarchy of hard problems in the separated fragment. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, pages 1-12, 2017. URL:
  38. Jouko Väänänen. Dependence logic: A New Approach to Independence Friendly Logic. Number 70 in London Mathematical Society student texts. Cambridge University Press, Cambridge ; New York, 2007. Google Scholar
  39. Fan Yang and Jouko Väänänen. Propositional logics of dependence. Ann. Pure Appl. Logic, 167(7):557-589, 2016. URL:
  40. Fan Yang and Jouko Väänänen. Propositional team logics. Ann. Pure Appl. Logic, 168(7):1406-1441, 2017. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail