Journal of Philosophical Logic 36 (5):557-570 (2007)
Authors |
|
Abstract |
Two consecution calculi are introduced: one for the implicational fragment of the logic of entailment with truth and another one for the disjunction free logic of nondistributive relevant implication. The proof technique—attributable to Gentzen—that uses a double induction on the degree and on the rank of the cut formula is shown to be insufficient to prove admissible various forms of cut and mix in these calculi. The elimination theorem is proven, however, by augmenting the earlier double inductive proof with additional inductions. We also give a new purely inductive proof of the cut theorem for the original single cut rule in Gentzen’s sequent calculus $ LK $ without any use of mix.
|
Keywords | admissible rule classical logic mix multiple induction relevance logics sequent calculi single cut rule structurally free logics |
Categories | (categorize this paper) |
DOI | 10.1007/s10992-007-9048-0 |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
No references found.
Citations of this work BETA
On the Decidability of Implicational Ticket Entailment.Katalin Bimbó & J. Michael Dunn - 2013 - Journal of Symbolic Logic 78 (1):214-236.
Valentini’s Cut-Elimination for Provability Logic Resolved.Rajeev Goré & Revantha Ramanayake - 2012 - Review of Symbolic Logic 5 (2):212-238.
A Cut-Free Sequent Calculus for Relevant Logic RW.M. Ili & B. Bori I. - 2014 - Logic Journal of the IGPL 22 (4):673-695.
Relevance Logics and Relation Algebras.Katalin Bimbó, J. Michael Dunn & Roger D. Maddux - 2009 - Review of Symbolic Logic 2 (1):102-131.
Similar books and articles
${LE}^{T}{{\Rightarrow}}$ , ${LR}^{\Circ}{\Hat{\Sim}}$, {LK} and Cutfree Proofs.Katalin Bimbó - 2007 - Journal of Philosophical Logic 36 (5):557-570.
Probabilistic Proofs and Transferability.Kenny Easwaran - 2009 - Philosophia Mathematica 17 (3):341-362.
The Role of Diagrams in Mathematical Arguments.David Sherry - 2008 - Foundations of Science 14 (1-2):59-74.
Lower Bounds for Cutting Planes Proofs with Small Coefficients.Maria Bonet, Toniann Pitassi & Ran Raz - 1997 - Journal of Symbolic Logic 62 (3):708-728.
Why Do Mathematicians Re-Prove Theorems?John W. Dawson Jr - 2006 - Philosophia Mathematica 14 (3):269-286.
Proofs as Acts and Proofs as Objects: Some Questions for Dag Prawitz.Goran Sundholm - 1998 - Theoria 64 (2-3):187-216.
Analytics
Added to PP index
2009-01-28
Total views
11 ( #790,838 of 2,401,764 )
Recent downloads (6 months)
1 ( #551,897 of 2,401,764 )
2009-01-28
Total views
11 ( #790,838 of 2,401,764 )
Recent downloads (6 months)
1 ( #551,897 of 2,401,764 )
How can I increase my downloads?
Downloads