Abstract
We present a rooted hypersequent calculus for modal propositional logic S5. We show that all rules of this calculus are invertible and that the rules of weakening, contraction, and cut are admissible. Soundness and completeness are established as well.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Avron, A.: The method of hypersequents in the proof theory of propositional non-classical logics. In: Hodges, W., Hyland, M., Steinhorn, C., Truss, J. (eds.) Logic: From Foundations to Applications. Clarendon Press, Oxford (1996)
Bednarska, K., Indrzejczak, A.: Hypersequent calculi for S5: the methods of cut elimination. Log. Log. Philos. 24, 277–311 (2015). https://doi.org/10.12775/LLP.2015.018
Belnap, N.D.: Display logic. J. Philos. Log. 11(4), 375–417 (1982). https://doi.org/10.1007/BF00284976
Blackburn, P., De Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)
Braüner, T.: A cut-free Gentzen formulation of the modal logic S5. Log. J. IGPL 8(5), 629–643 (2000). https://doi.org/10.1093/jigpal/8.5.629
Brünnler, K.: Deep sequent systems for modal logic. Arch. Math. Log. 48(6), 551–577 (2009). https://doi.org/10.1007/s00153-009-0137-3
Chellas, F.B.: Modal Logic: An Introduction. Cambridge University Press, Cambridge (1980)
Fitting, M.: Proof Methods for Modal and Intuitionistic Logics. Reidel, Dordrecht (1983)
Indrzejczak, A.: Cut-free double sequent calculus for S5. Log. J. IGPL 6(3), 505–516 (1998). https://doi.org/10.1093/jigpal/6.3.505
Kurokawa, H.: Hypersequent calculi for modal logics extending S4. In: Nakano, Y., Satoh, K., Bekki, D. (eds.) JSAI-isAI 2013. LNCS, vol. 8417, pp. 51–68. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-319-10061-6_4
Kuznets, R., Lellmann, B.: Grafting hypersequents onto nested sequents. Log. J. IGPL 24, 375–423 (2016). https://doi.org/10.1093/jigpal/jzw005
Lahav, O.: From frame properties to hypersequent rules in modal logics. In: LICS (2013)
Lellmann, B.: Hypersequent rules with restricted contexts for propositional modal logics. Theor. Comput. Sci. 656, 76–105 (2016)
Lellmann, B., Pattinson, D.: Correspondence between modal Hilbert axioms and sequent rules with an application to S5. In: Galmiche, D., Larchey-Wendling, D. (eds.) Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 22nd International Conference, TABLEAUX 2013, Nancy, France, September 16–19, 2013, volume 8123 of Lecture Notes in Computer Science, pp. 219–233. Springer (2013)
Mints, G.: Indexed systems of sequents and cut-elimination. J. Philos. Log. 26(6), 671–696 (1997). https://doi.org/10.1023/A:1017948105274
Negri, S.: Proof analysis in modal logic. J. Philos. Log. 34(5), 507–544 (2005). https://doi.org/10.1007/s10992-005-2267-3
Negri, S., Von Plato, J., Ranta, A.: Structural Proof Theory. Cambridge University Press, Cambridge (2008)
Ohnishi, M., Matsumoto, K.: Gentzen method in modal calculi II. Osaka Math. J. 11, 115–120 (1959)
Poggiolesi, F.: A cut-free simple sequent calculus for modal logic S5. Rev. Symb. Log. 1(1), 3–15 (2008). https://doi.org/10.1017/S1755020308080040
Poggiolesi, F.: Gentzen Calculi for Modal Propositional Logic, Volume 32 of Trends in Logic. Springer, New York (2011)
Pottinger, G.: Uniform, cut-free formulations of T, S 4, and S 5 (abstract). J. Symb. Log. 48, 900 (1983)
Restall, G.: Proofnets for S5: sequents and circuits for modal logic. In: Logic Colloquium 2005, Volume 28 of Lecture Notes in Logic, pp. 151–17. Cambridge University Press, Cambridge (2007)
Sato, M.: A cut-free Gentzen-type system for the modal logic S5. J. Symb. Log. 45(1), 67–84 (1980). https://doi.org/10.2307/2273355
Stouppa, P.: A deep inference system for the modal logic S5. Stud. Log. 85(2), 199–214 (2007). https://doi.org/10.1007/s11225-007-9028-y
Troelstra, A., Schwichtenberg, H.: Basic Proof Theory. Cambridge University Press, Amsterdam (1996)
Wansing, H.: Sequent calculi for normal modal propositional logics. J. Log. Comput. 4(2), 125–142 (1994). https://doi.org/10.1093/logcom/4.2.125
Wansing, H.: Predicate logics on display. Stud. Log. 62(1), 49–75 (1999). https://doi.org/10.1007/978-94-017-1280-4_12
Acknowledgements
The authors would like to thank Meghdad Ghari for useful suggestions. We would also like to thank the anonymous reviewers whose comments helped to improve this manuscript.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Mohammadi, H., Aghaei, M. Rooted Hypersequent Calculus for Modal Logic S5. Log. Univers. 17, 269–295 (2023). https://doi.org/10.1007/s11787-023-00328-w
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11787-023-00328-w