Abstract
In [J. Andrikonis, Loop-free calculus for modal logic S4. I, Lith. Math. J., 52(1):1–12, 2012], loop-free calculus for modal logic S4 is presented. The calculus uses several types of indexes to avoid loops and obtain termination of derivation search. Although the mentioned article proves that derivation search in the calculus is finite, the proof of soundness and completeness is omitted and, therefore, is presented in this paper. Moreover, this paper presents loop-free calculus for modal logics K4, which is obtained by modifying the calculus for S4. Finally, some remarks for programming the given calculi are offered.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Andrikonis, Loop-free calculus for modal logic S4. I, Lith. Math. J., 52(1):1–12, 2012.
M. Fitting, Modal proof theory, in P. Blackburn, J. Van Benthem, and F. Wolter (Eds.), Handbook of Modal Logic, Elsevier, Amsterdam, 2007, pp. 85–138.
S. Kanger, Provability in Logic, Almgvist & Wiksell, Stockholm, 1957.
D. Leszczyńska-Jasion, A loop-free decision procedure for modal propositional logics K4, S4, and S5, J. Philos. Log., 38(2):151–177, 2009.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Andrikonis, J. Loop-free calculus for modal logic S4. II. Lith Math J 52, 123–133 (2012). https://doi.org/10.1007/s10986-012-9160-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10986-012-9160-x