- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On some proof theoretical properties of the modal logic GL
Studia Logica 42 (4):453 - 459 (1983)
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.My notes
Similar books and articles
Effective Cut-elimination for a Fragment of Modal mu-calculus.Grigori Mints - 2012 - Studia Logica 100 (1-2):279-287.
Proof-theoretic modal pa-completeness I: A system-sequent metric.Paolo Gentilini - 1999 - Studia Logica 63 (1):27-48.
Syntactical results on the arithmetical completeness of modal logic.Paolo Gentilini - 1993 - Studia Logica 52 (4):549 - 564.
On the proof of Solovay's theorem.Dick Jongh, Marc Jumelet & Franco Montagna - 1991 - Studia Logica 50 (1):51 - 69.
A proof-theoretic study of the correspondence of classical logic and modal logic.H. Kushida & M. Okada - 2003 - Journal of Symbolic Logic 68 (4):1403-1414.
Indexed systems of sequents and cut-elimination.Grigori Mints - 1997 - Journal of Philosophical Logic 26 (6):671-696.
Analytics
Added to PP
2009-01-28
Downloads
51 (#305,341)
6 months
2 (#1,232,442)
2009-01-28
Downloads
51 (#305,341)
6 months
2 (#1,232,442)
Historical graph of downloads
Citations of this work
Cut Elimination for GLS Using the Terminability of its Regress Process.Jude Brighton - 2016 - Journal of Philosophical Logic 45 (2):147-153.
Valentini’s cut-elimination for provability logic resolved.Rajeev Goré & Revantha Ramanayake - 2012 - Review of Symbolic Logic 5 (2):212-238.
Syntactical results on the arithmetical completeness of modal logic.Paolo Gentilini - 1993 - Studia Logica 52 (4):549 - 564.
Cut-elimination for Weak Grzegorczyk Logic Go.Rajeev Goré & Revantha Ramanayake - 2014 - Studia Logica 102 (1):1-27.
Proof-theoretic modal pa-completeness I: A system-sequent metric.Paolo Gentilini - 1999 - Studia Logica 63 (1):27-48.
References found in this work
Proof theory.Gaisi Takeuti - 1975 - New York, N.Y., U.S.A.: Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co..
The unprovability of consistency: an essay in modal logic.George Boolos - 1979 - New York: Cambridge University Press.
Untersuchungen über das logische Schließen. I.Gerhard Gentzen - 1935 - Mathematische Zeitschrift 35:176–210.
Untersuchungen über das logische Schließen. II.Gerhard Gentzen - 1935 - Mathematische Zeitschrift 39:405–431.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-4c2ch uwo