\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ LE^{t}{ \to } $$\end{document}, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$LR^{ \circ }{{\widehat{ \sim }}}$$\end{document}, LK and Cutfree Proofs [Book Review]

Journal of Philosophical Logic 36 (5):557-570 (2007)
  Copy   BIBTEX

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 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ LK $$\end{document} without any use of mix.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,440

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On the relationships between ATR0 and $\widehat{ID}_{.Jeremy Avigad - 1996 - Journal of Symbolic Logic 61 (3):768 - 779.
Fixed point theories and dependent choice.Gerhard Jäger & Thomas Strahm - 2000 - Archive for Mathematical Logic 39 (7):493-508.
Lemmon-Style Bases for the Systems $S1^circ - S4^circ$.J. Jay Zeman - 1968 - Journal of Symbolic Logic 33 (3):458-461.
LEt ® , LR °[^( ~ )], 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.
Marginalia on sequent calculi.A. S. Troelstra - 1999 - Studia Logica 62 (2):291-303.
The Parallel versus Branching Recurrences in Computability Logic.Wenyan Xu & Sanyang Liu - 2013 - Notre Dame Journal of Formal Logic 54 (1):61-78.

Analytics

Added to PP
2017-02-20

Downloads
16 (#913,005)

6 months
7 (#441,834)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Katalin Bimbo
University of Alberta

Citations of this work

New Consecution Calculi for R→t.Katalin Bimbó & J. Michael Dunn - 2012 - Notre Dame Journal of Formal Logic 53 (4):491-509.
Trees for E.Shawn Standefer - 2018 - Logic Journal of the IGPL 26 (3):300-315.
Dual Gaggle Semantics for Entailment.Katalin Bimbó - 2009 - Notre Dame Journal of Formal Logic 50 (1):23-41.
A cut-free sequent calculus for relevant logic RW.M. Ili & B. Bori I. - 2014 - Logic Journal of the IGPL 22 (4):673-695.

Add more citations

References found in this work

No references found.

Add more references