Complexity of the Universal Theory of Modal Algebras
- 16 Downloads
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.
KeywordsUniversal theory Complexity Monotonic modal algebra Normal modal algebra Partial algebra Quasi-equational theory
Unable to display preview. Download preview PDF.
We are grateful to the anonymous referees for suggestions that improved the presentation of this article.
- 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.Google Scholar
- 4.Blackburn, P., M. De Rijke, and Y. Venema, Modal Logic, vol 53 of Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 2001.Google Scholar
- 6.Burris, S., and H. P. Sankappanavar, A Course in Universal Algebra. Graduate Texts in Mathematics. Springer-Verlag, 1981.Google Scholar
- 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.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.Google Scholar
- 22.Rybakov, V. V., Admissibility of Logical Inference Rules, vol. 136 of Studies in Logic and the Foundations of Mathematics, Elsevier, 1997.Google Scholar
- 23.Shkatov, D., and C. J. Van Alten, Complexity of the universal theory of distributive lattice-ordered residuated groupoids. Submitted.Google Scholar
- 24.Spaan, E., Complexity of Modal Logics. PhD thesis, Universiteit van Amsterdam, 1993.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.Google Scholar
- 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.Google Scholar