Skip to main content
SpringerLink
Log in

Complexity of the Universal Theory of Modal Algebras

  • Published:
Studia Logica Aims and scope Submit manuscript

A Correction to this article was published on 27 February 2019

This article has been updated

Abstract

We apply the theory of partial algebras, following the approach developed by Van Alten (Theor Comput Sci 501:82–92, 2013), to the study of the computational complexity of universal theories of monotonic and normal modal algebras. We show how the theory of partial algebras can be deployed to obtain co-NP and EXPTIME upper bounds for the universal theories of, respectively, monotonic and normal modal algebras. We also obtain the corresponding lower bounds, which means that the universal theory of monotonic modal algebras is co-NP-complete and the universal theory of normal modal algebras is EXPTIME-complete. It also follows that the quasi-equational theory of monotonic modal algebras is co-NP-complete. While the EXPTIME upper bound for the universal theory of normal modal algebras can be obtained in a more straightforward way, as discussed in the paper, due to its close connection to the equational theory of normal modal algebras with the universal modality operator, the technique based on the theory of partial algebras is applicable to the study of universal theories of algebras corresponding to a wide range of logics with intensional operators, where no such connection is available.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Change history

  • 27 February 2019

    In the original publication of the article, the authors name were abbreviated as “D. Shkatov” and “C. J. Van Alten”. However it should be “Dmitry Shkatov” and “Clint J. Van Alten”. The original article has been corrected.

References

  1. Avron, A., The method of hypersequents in the proof theory of propositional non-classical logics, in W. Hodges, M. Hyland, C. Steinhorn, and J. Truss, (eds.), Logic: From Foundations to Applications, Clarendon Press, 1996, pp. 1–32.

  2. Bezhanishvili, G., N. Bezhanishvili, and R. Iemhoff, Stable canonical rules. Journal of Symbolic Logic 81(1):284–315, 2016.

    Article  Google Scholar 

  3. Bezhanishvili, G., N. Bezhanishvili, and J. Ilin, Stable modal logics. Review of Symbolic Logic 11(3):436–469, 2018.

    Article  Google Scholar 

  4. Blackburn, P., M. DeRijke, and Y. Venema, Modal Logic, vol 53 of Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 2001.

  5. Blackburn, P., and E. Spaan, A modal perspective on the computational complexity of attribute value grammar. Journal of Logic, Language, and Information 2:129–169, 1993.

    Article  Google Scholar 

  6. Burris, S., and H. P. Sankappanavar, A Course in Universal Algebra. Graduate Texts in Mathematics. Springer-Verlag, 1981.

  7. Chen C.-C., and I.-P. Lin, The complexity of propositional modal theories and the complexity of consistency of propositional modal theories, in A. Nerode and Y. V. Matiyasevich, (eds.), Logical Foundations of Computer Science, vol. 813 of Lecture Notes in Computer Science, Springer, 1994, pp. 69–80.

  8. Chlebus, B. S., Domino-tiling games. Journal of Computer and System Sciences 32:374–392, 1986.

    Article  Google Scholar 

  9. Evans, T., Some connections between residual finiteness, finite embeddability and the word problem. Journal of the London Mathematical Society 1:399–403, 1969.

    Article  Google Scholar 

  10. Fischer, M. J., and R. E. Ladner, Propositional dynamic logic of regular programs. Journal of Computer and System Sciences 18:194–211, 1979.

    Article  Google Scholar 

  11. Goranko, V., and S. Passy, Using the universal modality: Gains and questions. Journal of Logic and Computation 2(1):5–30, 1992.

    Article  Google Scholar 

  12. Iemhoff, R., On rules. Journal of Philosophical Logic 44(6):697–711, 2015.

    Article  Google Scholar 

  13. Iemhoff, R., Consequence relations and admissible rules. Journal of Philosophical Logic 45(3):327–348, 2016.

    Article  Google Scholar 

  14. Jeřábek, E., Canonical rules. Journal of Symbolic Logic 74(4):1171–1205, 2009.

    Article  Google Scholar 

  15. Kracht, M., Review of [22]. Notre Dame Journal Formal Logic 40(4):578–587, 1999.

    Article  Google Scholar 

  16. Ladner, R. E., The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing 6:467–480, 1977.

    Article  Google Scholar 

  17. Lellmann, B., Hypersequent rules with restricted contexts for propositional modal logics. Theoretical Computer Science 656:76–105, 2016.

    Article  Google Scholar 

  18. Marx, M., Complexity of modal logic, in P. Blackburn, J. Van Benthem, and F. Wolter, (eds.), Handbook of Modal Logic, vol. 3 of Studies in Logic and Practical Reasoning, Elsevier, 2007.

  19. McKinsey, J. C. C., and A. Tarski, On closed elements in closure algebras. Annals of Mathematics 47:122–162, 1946.

    Article  Google Scholar 

  20. Pacuit, E., Neighborhood Semantics for Modal Logic. Short Textbooks in Logic. Springer, 2017.

    Book  Google Scholar 

  21. Rybakov, M., and D. Shkatov, Complexity and expressivity of propositional dynamic logics with finitely many variables. Logic Journal of the IGPL 26(5):539–547, 2018.

    Article  Google Scholar 

  22. Rybakov, V. V., Admissibility of Logical Inference Rules, vol. 136 of Studies in Logic and the Foundations of Mathematics, Elsevier, 1997.

  23. Shkatov, D., and C. J. Van Alten, Complexity of the universal theory of distributive lattice-ordered residuated groupoids. Submitted.

  24. Spaan, E., Complexity of Modal Logics. PhD thesis, Universiteit van Amsterdam, 1993.

  25. Van Alten, C. J., Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras. Theoretical Computer Science 501:82–92, 2013.

    Article  Google Scholar 

  26. Vardi, M., On the complexity of epistemic reasoning, in Proceedings of Fourth Annual Symposium on Logic in Computer Science, IEEE, 1989, pp. 243–252.

  27. Venema, Y., Algebras and coalgebras, in P. Blackburn, J. Van Benthem, and F. Wolter, (eds.), Handbook of Modal Logic, vol. 3 of Studies in Logic and Practical Reasoning, Elsevier, 2007, pp. 331–426.

Download references

Acknowledgements

We are grateful to the anonymous referees for suggestions that improved the presentation of this article.

Author information

Authors and Affiliations

  1. School of Computer Science and Applied Mathematics, University of the Witwatersrand, Johannesburg, Private Bag 3 , Wits, 2050, South Africa

    Dmitry Shkatov & Clint J. Van Alten

Authors
  1. Dmitry Shkatov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Clint J. Van Alten
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dmitry Shkatov.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Presented by Yde Venema

The original version of this article was revised: The given name of the authors are “Dmitry” and “Clint”.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shkatov, D., Van Alten, C.J. Complexity of the Universal Theory of Modal Algebras. Stud Logica 108, 221–237 (2020). https://doi.org/10.1007/s11225-018-09842-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11225-018-09842-1

Keywords

Search

Navigation