Abstract
We describe the tableau and inverse calculi for the propositional modal logic S4. The formulas are treated as sets of paths. We obtain the upper bound for the number of applications of rules in the deduction tree.
Similar content being viewed by others
REFERENCES
A. Degtyarev and A. Voronkov, The inverse method, Handbook of Automated Reasoning, Elsevier Science Publishers (2001).
G. Mints, V. Orevkov, and T. Tammet, Transfer of sequent calculus strategies to resolution for S4, Proof Theory and Modal Logic, Kluwer Academic Publishers (1996).
G. Mints, Gentzen-type systems and resolution rule. Part I, Lecture Notes in Comput. Sci., 417, 198–231 (1988).
S. Norgėla, Decidability of some classes of modal logic (http://www.mif.vu.lt/katedros/cs), Lith. Math. J., 42(2), 174–181 (2002).
A. Voronkov, How to optimize proof-search in modal logics: new methods of proving redundancy criteria for sequent calculi, ACM Trans. Comput. Logic, 1(4), 182–215 (2001).
Author information
Authors and Affiliations
Additional information
__________
Translated from Lietuvos Matematikos Rinkinys, Vol. 45, No. 1, pp. 117–126, January–March, 2005.
Translated by R. Lapinskas
Rights and permissions
About this article
Cite this article
Norgėla, S. Path calculus in the modal logic S4. Lith Math J 45, 94–101 (2005). https://doi.org/10.1007/s10986-005-0010-y
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10986-005-0010-y