Abstract
In the first part of the book we defined what it means for a sequent calculus to be good and we explained the reasons why it is important for a logic to have a good Gentzen calculus. In the second part of the book we set out the numerous attempts made at providing the main systems of modal logic with a proof calculus while showing their limits and their benefits. Our aim in this last part of the book is to present and deeply analyse a new method for generating good extensions of the sequent calculus for the SLH-systems plus GL.
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
References
A. Avron. A constructive analysis of RM. Journal of Symbolic Logic, 52:939–951, 1987.
A. Avron. Using hypersequents in proof systems for non-classical logics. Annals of Mathematics and Artificial Intelligence, 4:225–248, 1991.
M. Baaz and R. Zach. Hypersequents and cut elimination for intuitionistic fuzzy logic. In G. Peter and H. Schwichtenberg, editors, 14th International Workshop, CSL 2000. Fischbachau, Germany, August 21–26, 2000. Proceedings, pp. 187–201. Springer, Berlin, 2000.
K. Brünnler. Deep sequent systems for modal logic. In G. Governatori, I. Hodkinson, and Y. Venema, editors, Advances in Modal Logic, Vol 6, pp. 107–119. College Publications, London, 2006.
K. Brünnler and L. Strassburger. Modular sequent systems for modal logic. In M. Giese and A Waaler, editors, Proceeding of Tableaux 2009, LNAI 5607, pp. 152–166. Springer, Berlin-Heidelberg, 2009.
A. Ciabattoni. Hypersequent calculi for some intermediate logics with bounded Kripke models. Journal of Logic and Computation, 11:283–294, 2001.
I. Hasuo and R. Kashima. Kripke completeness of first-order constructive logics with strong negation. Logic Journal of the IGPL, 11:615–646, 2003.
B. Hill and F. Poggiolesi. A contraction-free and cut-free sequent calculus for propositional dynamic logic. Studia Logica, 94:68–94, 2010.
R. Ishigaki and K. Kikuchi. Tree-sequent method for subintuitionistic predicate logics. Proceedings of the 16th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, LNAI, 4548:149–164, 2007.
R. Kashima. Cut-free sequent calculi for some tense logics. Studia Logica, 53:119–135, 1994.
G. Metcalfe, N. Olivetti, and D. M. Gabbay. Sequent and hypersequent calculi for Abelian and Lukasiewicz logics. ACM Transaction on Computational Logic (TOCL), 1:691–746, 1991.
F. Poggiolesi. The method of tree-hypersequent for modal propositional logic. In D. Makinson, J. Malinowski, and H. Wansing, editors, Towards Mathematical Philosophy, pp. 31–51. Springer, Berlin, 2008.
F. Poggiolesi. Sequent Calculi for Modal Logic. Ph.D. Thesis, Florence/ Paris, 2008.
F. Poggiolesi. A purely syntactic and cut-free sequent calculus for the modal logic of provability. Review of Symbolic Logic, 2:593–611, 2009.
F. Poggiolesi. Reflecting the semantic features of S5 at the syntactic level. In C. Sinigaglia and M. D’Agostino, editors, Proceedings of SILFS Conference. College Publications, London, forthcoming.
G. Pottinger. Uniform cut-free formulations of T, S4 and S5 (abstract). Journal of Symbolic Logic, 48:900, 901, 1983.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Poggiolesi, F. (2010). On the Tree-Hypersequent Calculi. In: Gentzen Calculi for Modal Propositional Logic. Trends in Logic, vol 32. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-9670-8_6
Download citation
DOI: https://doi.org/10.1007/978-90-481-9670-8_6
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-9669-2
Online ISBN: 978-90-481-9670-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)