Abstract
In this paper we present a method, that we call the tree-hypersequent method, for generating contraction-free and cut-free sequent calculi for modal propositional logics. We show how this method works for the systems K, KD, K4 and KD4, by giving a sequent calculus for these systems which are normally presented in the Hilbert style, and by proving all the main results in a purely syntactical way.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avron, A., ‘The method of hypersequents in the proof theory of propositional non-classical logic’, in Steinhorn, C., Strauss, J., Hodges, W., Hyland, M. (eds.), Logic: from Foundations to Applications, Oxford University Press, Oxford, 1996.
Brünnler, T., ‘Deep sequent systems for modal logic’, Advances in Modal Logic AiML, 6: 107–119, 2006.
Goble, L., ‘Gentzen systems for modal logic’, Notre Dame Journal of Formal Logic, 15: 455–461, 1974.
Indrzejczak, A., ‘Generalised sequent calculus for propositional modal logics’, Logica Trianguli, 1: 15–31, 1997.
Kashima, R., ‘Cut-free sequent calculi for some tense logics’, Studia Logica, 53: 119–135, 1994.
Matsumoto, M., Ohnishi, K., ‘Gentzen method in modal calculi’, Osaka Mathematical Journal, 9 and 11: 115–120, 1959.
Mints, G., ‘Indexed systems of sequents and cut-elimination’, Journal of Philosophical Logic, 26: 671–696, 1997.
Negri, S., ‘Proof analysis in modal logic’, Journal of Philosophical Logic, 34, 2005.
Poggiolesi, F., ‘A cut-free simple sequent calculus for modal logic s5’, Submitted to the Review of Symbolic Logic, June 2007.
Poggiolesi, F., ‘Sequent calculus for modal logic’, Logic Colloquium, 2006.
Sambin, G., Valentini, S., ‘The modal logic of provability. The sequential approach’, Journal of Philosophical Logic, 11: 311–342, 1982.
Wansing, H., ‘Sequent calculi for normal modal propositional logics’, Journal of Logic and Computation, 4: 125–142, 1994.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Poggiolesi, F. (2009). The Method of Tree-Hypersequents for Modal Propositional Logic. In: Makinson, D., Malinowski, J., Wansing, H. (eds) Towards Mathematical Philosophy. Trends in Logic, vol 28. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-9084-4_3
Download citation
DOI: https://doi.org/10.1007/978-1-4020-9084-4_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-9083-7
Online ISBN: 978-1-4020-9084-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)