Avron A. (1996). The method of hypersequents in the proof theory of propositional non-classical logic. In Hodges W., Hyland M., Steinhorn C., and Strauss J., editors. Logic: From Foundations to Applications. Oxford: Oxford University Press, pp. 1–32.
Hill B., & Poggiolesi F. (2009). A contraction-free and cut-free sequent calculus for propositional dynamic logic. Studia Logica. Forthcoming.
Kashima R. (1994). Cut-free sequent calculi for some tense logics. Studia Logica, 53, 119–135.
Leivant D. (1981). On the proof theory of the modal logic for arithmetic provability. Journal of Symbolic Logic, 46, 531–538.
Moen A. (2003). The proposed algorithms for eliminating cuts in the provability calculus GLS do not terminate. Nordic Workshop on Programming Theory, Norwegian Computing Center, 2001-12-10, 2001.
Negri S. (2005). Proof analysis in modal logic. Journal of Philosophical Logic, 34, 507–534.
Poggiolesi F. (2008). Sequent calculi modal logic. , pp. 1–224. Department of Philosophy, University of Florence and IHPST, Paris 1-Sorbonne.
Poggiolesi F. (2009a). The method of tree-hypersequent for modal propositional logic. In Makinson D., Malinowski J., and Wansing H., editors. Trends in Logic: Towards Mathematical Philosophy. Berlin: Springer, pp. 31–51.
Poggiolesi F. (2009b). Reflecting the semantic features of S5 at the syntactic level. SILFS Conference Proceedings. Forthcoming.
Sasaki K. (2001). Löb’s axiom and cut-elimination theorem. Journal of the Nanzan Academic Society Mathematical Sciences and Information Engineering, 1, 91–98.
Valentini S. (1983). The modal logic of provability: Cut-elimination. Journal of Philosophical Logic, 12, 471–476.
Wansing H. (1994). Sequent calculi for normal modal propositional logics. Journal of Logic and Computation, 4, 125–142.
Wansing H. (2002). Sequent systems for modal logics. In Gabbay D. and Guenther F., editors. Handbook of Philosophical Logic (second edition). Dordrecht: Kluwer, pp. 61–145.