A minimal classical sequent calculus free of structural rules

Annals of Pure and Applied Logic 161 (10):1244-1253 (2010)
  Copy   BIBTEX

Abstract

Gentzen’s classical sequent calculus has explicit structural rules for contraction and weakening. They can be absorbed by replacing the axiom P,¬P by Γ,P,¬P for any context Γ, and replacing the original disjunction rule with Γ,A,B implies Γ,AB.This paper presents a classical sequent calculus which is also free of contraction and weakening, but more symmetrically: both contraction and weakening are absorbed into conjunction, leaving the axiom rule intact. It uses a blended conjunction rule, combining the standard context-sharing and context-splitting rules: Γ,Δ,A and Γ,Σ,B implies Γ,Δ,Σ,AB. We refer to this system as minimal sequent calculus.We prove a minimality theorem for the propositional fragment : any propositional sequent calculus S is complete if and only if S contains. Thus one can view as a minimal complete core of Gentzen’s.

Links

PhilArchive



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

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

Investigations into a left-structural right-substructural sequent calculus.Lloyd Humberstone - 2007 - Journal of Logic, Language and Information 16 (2):141-171.
Varieties of linear calculi.Sara Negri - 2002 - Journal of Philosophical Logic 31 (6):569-590.
Cuts, Gluts and Gaps.Vincent Degauquier - 2012 - Logique Et Analyse 55 (218):229-240.

Analytics

Added to PP
2013-12-18

Downloads
42 (#380,966)

6 months
3 (#984,770)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dominic Hughes
St. Francis Xavier University

Citations of this work

Fractional semantics for classical logic.Mario Piazza & Gabriele Pulcini - 2020 - Review of Symbolic Logic 13 (4):810-828.
Cut elimination by unthreading.Gabriele Pulcini - 2023 - Archive for Mathematical Logic 63 (1):211-223.

Add more citations

References found in this work

Linear Logic.Jean-Yves Girard - 1987 - Theoretical Computer Science 50:1–102.

Add more references