Further Results on Tree-Hypersequent Calculi

  • Francesca PoggiolesiEmail author
Part of the Trends in Logic book series (TREN, volume 32)


Tree-hypersequent calculi have several characteristics in addition to those presented above; the object of this chapter is to provide an overview of them. Specifically, in the first section, we will explore the link between tree-hypersequent calculi and display calculi. In this way we will supplement Table 5.4, p. 116. In the second section we will mention logics to which the tree-hypersequent method has been applied that are not modal logics. We will bring our analysis to a close by suggesting further developments employing the framework of tree-hypersequent calculi.


  1. 17.
    K. Brünnler and T. Stüder. Syntactic cut-elimination for common knowledge. Annals of Pure and Applied Logic, 160:82–95, 2009.CrossRefGoogle Scholar
  2. 26.
    A. Ciabattoni, L. Strassburger, and K. Terui. Expanding the realm of systematic proof theory. In E. Grädel and R. Kahle, editors, Lectures Notes in Computer Science, pp. 163–178. Springer, Berlin-Heidelberg, 2009.Google Scholar
  3. 55.
    I. Hasuo and R. Kashima. Kripke completeness of first-order constructive logics with strong negation. Logic Journal of the IGPL, 11:615–646, 2003.CrossRefGoogle Scholar
  4. 60.
    B. Hill and F. Poggiolesi. A contraction-free and cut-free sequent calculus for propositional dynamic logic. Studia Logica, 94:68–94, 2010.CrossRefGoogle Scholar
  5. 66.
    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.CrossRefGoogle Scholar
  6. 82.
    G. Mints. Indexed systems of sequents and cut-elimination. Journal of Philosophical Logic, 26:671–696, 1997.CrossRefGoogle Scholar
  7. 117.
    G. Restall. Proofnets for S5: sequents and circuits for modal logic. In C. Dimitracopoulos, L. Newelski, and D. Normann, editors, Logic Colloquium 2005, pp. 151–172. Cambridge University Press, Cambridge, 2007.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2010

Authors and Affiliations


Personalised recommendations