- 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
New sequent calculi for Visser's Formal Propositional Logic
Mathematical Logic Quarterly 49 (5):525 (2003)
Abstract
Two cut-free sequent calculi which are conservative extensions of Visser's Formal Propositional Logic are introduced. These satisfy a kind of subformula property and by this property the interpolation theorem for FPL are proved. These are analogies to Aghaei-Ardeshir's calculi for Visser's Basic Propositional Logic.My notes
Similar books and articles
Sequent Calculi for Visser's Propositional Logics.Kentaro Kikuchi & Ryo Kashima - 2001 - Notre Dame Journal of Formal Logic 42 (1):1-22.
A proof-search procedure for intuitionistic propositional logic.R. Alonderis - 2013 - Archive for Mathematical Logic 52 (7-8):759-778.
Basic Propositional Calculus II. Interpolation: II. Interpolation.Mohammad Ardeshir & Wim Ruitenburg - 2001 - Archive for Mathematical Logic 40 (5):349-364.
An approach to infinitary temporal proof theory.Stefano Baratella & Andrea Masini - 2004 - Archive for Mathematical Logic 43 (8):965-990.
A modal sequent calculus for a fragment of arithmetic.G. Sambin & S. Valentini - 1980 - Studia Logica 39 (2-3):245-256.
Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents.Rajeev Goré, Linda Postniece & Alwen Tiu - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 43-66.
Cut-elimination and a permutation-free sequent calculus for intuitionistic logic.Roy Dyckhoff & Luis Pinto - 1998 - Studia Logica 60 (1):107-118.
LEt ® , LR °[^( ~ )], LK and cutfree proofs.Katalin Bimbó - 2007 - Journal of Philosophical Logic 36 (5):557-570.
${LE}^{t}{{\rightarrow}}$ , ${LR}^{\circ}{\hat{\sim}}$, {LK} and Cutfree Proofs.Katalin Bimbó - 2007 - Journal of Philosophical Logic 36 (5):557-570.
A cut-free simple sequent calculus for modal logic S5.Francesca Poggiolesi - 2008 - Review of Symbolic Logic 1 (1):3-15.
Interpolation theorems, lower Bounds for proof systems, and independence results for bounded arithmetic.Jan Krajíček - 1997 - Journal of Symbolic Logic 62 (2):457-486.
Analytics
Added to PP
2013-12-01
Downloads
25 (#581,490)
6 months
4 (#573,918)
2013-12-01
Downloads
25 (#581,490)
6 months
4 (#573,918)
Historical graph of downloads
References found in this work
A propositional logic with explicit fixed points.Albert Visser - 1981 - Studia Logica 40 (2):155 - 175.
Basic Propositional Calculus I.Mohammad Ardeshir & Wim Ruitenburg - 1998 - Mathematical Logic Quarterly 44 (3):317-343.
Speaking about transitive frames in propositional languages.Yasuhito Suzuki, Frank Wolter & Michael Zakharyaschev - 1998 - Journal of Logic, Language and Information 7 (3):317-339.
Gentzen-style axiomatizations for some conservative extensions of basic propositional logic.Mojtaba Aghaei & Mohammad Ardeshir - 2001 - Studia Logica 68 (2):263-285.
Basic Propositional Calculus II. Interpolation: II. Interpolation.Mohammad Ardeshir & Wim Ruitenburg - 2001 - Archive for Mathematical Logic 40 (5):349-364.
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-6d9b7f7c4c-tstkh uwo