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
Entailment: The Logic of Relevance and Neccessity, Vol. I.Alan R. Anderson & Nuel D. Belnap - 1975 - Princeton University Press.
Structural Proof Theory.Sara Negri, Jan von Plato & Aarne Ranta - 2001 - Cambridge University Press.
Entailment: The Logic of Relevance and Necessity, Vol. II.Alan Ross Anderson, Nuel D. Belnap & J. Michael Dunn - 1992 - Princeton University Press.
Untersuchungen über das logische Schließen. I.Gerhard Gentzen - 1935 - Mathematische Zeitschrift 35:176–210.
Combinators and Structurally Free Logic.J. Dunn & R. Meyer - 1997 - Logic Journal of the IGPL 5 (4):505-537.
View all 8 references / Add more references
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
From Puzzles to Principles?: Essays on Aristotle's Dialectic.May Sim (ed.) - 1999 - Lexington Books.
On the Relationships Between ATR0 and $\Widehat{ID}_{.Jeremy Avigad - 1996 - Journal of Symbolic Logic 61 (3):768 - 779.
LEt ® , LR °[^( ~ )], LK and Cutfree Proofs.Katalin Bimbó - 2007 - Journal of Philosophical Logic 36 (5):557-570.
Isomorphisms of Splits of Computably Enumerable Sets.Peter A. Cholak & Leo A. Harrington - 2003 - Journal of Symbolic Logic 68 (3):1044-1064.
Probabilistic Proofs and Transferability.Kenny Easwaran - 2009 - Philosophia Mathematica 17 (3):341-362.
The Proof-Theoretic Analysis of Transfinitely Iterated Fixed Point Theories.Gerhard JÄger, Reinhard Kahle, Anton Setzer & Thomas Strahm - 1999 - Journal of Symbolic Logic 64 (1):53-67.
On Essentially Low, Canonically Well-Generated Boolean Algebras.Robert Bonnet & Matatyahu Rubin - 2002 - Journal of Symbolic Logic 67 (1):369-396.
Analytics
Added to PP index
2009-01-28
Total views
33 ( #308,813 of 2,401,722 )
Recent downloads (6 months)
4 ( #198,273 of 2,401,722 )
2009-01-28
Total views
33 ( #308,813 of 2,401,722 )
Recent downloads (6 months)
4 ( #198,273 of 2,401,722 )
How can I increase my downloads?
Downloads