Abstract
This paper deals with the system of modal logicGL, in particular with a formulation of it in terms of sequents. We prove some proof theoretical properties ofGL that allow to get the cut-elimination theorem according to Gentzen's procedure, that is, by double induction on grade and rank.
Similar content being viewed by others
References
G. Boolos,The Unprovability of Consistency, Cambridge University Press, Cambridge 1979.
G. Gentzen, Untersuchungen über das logische SchliessenMathematische Zeitschrift 39 (1935), pp. 176–210 and 405–431; English translation inM. Szabo (ed.),The Collected Papers of G. Gentzen, North-Holland, Amsterdam 1969.
S. C. Kleene,Introduction to Metamathematics North-Holland, Amsterdam 1952.
D. Leivant,On the proof theory of the modal logic for arithmetic provability Journal of Symbolic Logic 46 (1981), pp. 531–538.
G. Sambin andS. Valentini,A modal sequent calculus for a fragment of arithmetic Studia Logica 39 (1980), pp. 245–256.
G. Sambin andS. Valentini,Is there a syntactic proof of cut-elimination for GL?, Rapporto matematico n. 52 (1982), University of Siena.
B. Scarpellini,Proof Theory and Intuitionistic Systems Lecture Notes in Mathematics, 212, Springer, Berlin 1971.
G. Takeuti,Proof Theory North-Holland, Amsterdam 1975.
S. Valentini,The modal logic of provability: Cut-elimination, to appear in theJournal of Philosophical Logic.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Borga, M. On some proof theoretical properties of the modal logic GL. Stud Logica 42, 453–459 (1983). https://doi.org/10.1007/BF01371633
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01371633