Skip to main content
×
Home
    • Aa
    • Aa

A PURELY SYNTACTIC AND CUT-FREE SEQUENT CALCULUS FOR THE MODAL LOGIC OF PROVABILITY

  • FRANCESCA POGGIOLESI (a1)
Abstract

In this paper we present a sequent calculus for the modal propositional logic GL (the logic of provability) obtained by means of the tree-hypersequent method, a method in which the metalinguistic strength of hypersequents is improved, so that we can simulate trees shapes. We prove that this sequent calculus is sound and complete with respect to the Hilbert-style system GL, that it is contraction free and cut free and that its logical and modal rules are invertible. No explicit semantic element is used in the sequent calculus and all the results are proved in a purely syntactic way.

Copyright
Corresponding author
*CENTRE FOR LOGIC AND PHILOSOPHY OF SCIENCE, VRIJE UNIVERSITEIT BRUSSEL, ETTERBEEK CAMPUS, PLEINLAAN 2, B-1050 BRUSSELS, BELGIUM E-mail:poggiolesi@gmail.com
References
Hide All
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. 132.
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, 119135.
Leivant D. (1981). On the proof theory of the modal logic for arithmetic provability. Journal of Symbolic Logic, 46, 531538.
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, 507534.
Poggiolesi F. (2008). Sequent calculi modal logic. PhD Thesis, pp. 1224. 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. 3151.
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, 9198.
Valentini S. (1983). The modal logic of provability: Cut-elimination. Journal of Philosophical Logic, 12, 471476.
Wansing H. (1994). Sequent calculi for normal modal propositional logics. Journal of Logic and Computation, 4, 125142.
Wansing H. (2002). Sequent systems for modal logics. In Gabbay D. and Guenther F., editors. Handbook of Philosophical Logic (second edition). Dordrecht: Kluwer, pp. 61145.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Review of Symbolic Logic
  • ISSN: 1755-0203
  • EISSN: 1755-0211
  • URL: /core/journals/review-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 11 *
Loading metrics...

Abstract views

Total abstract views: 105 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 19th October 2017. This data will be updated every 24 hours.