Towards a Semantic Characterization of Cut-Elimination

&
Studia Logica 82 (1):95-119 (2006)
  Copy   BIBTEX

Abstract

We introduce necessary and sufficient conditions for a (single-conclusion) sequent calculus to admit (reductive) cut-elimination. Our conditions are formulated both syntactically and semantically.

Categories

Keywords

Reprint years

DOI

10.1007/s11225-006-6607-2

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

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

Through your library

My notes

Similar books and articles

Algebraic proof theory for substructural logics: cut-elimination and completions.Agata Ciabattoni, Nikolaos Galatos & Kazushige Terui - 2012 - Annals of Pure and Applied Logic 163 (3):266-290.
Towards a Semantic Characterization of Cut-Elimination.Kazushige Terui - 2006 - Studia Logica 82 (1):95-119.
Which Structural Rules Admit Cut Elimination? An Algebraic Criterion.Kazushige Terui - 2007 - Journal of Symbolic Logic 72 (3):738 - 754.
A Simple Proof that Super-Consistency Implies Cut Elimination.Gilles Dowek & Olivier Hermant - 2012 - Notre Dame Journal of Formal Logic 53 (4):439-456.
Cut-Elimination: Syntax and Semantics.M. Baaz & A. Leitsch - 2014 - Studia Logica 102 (6):1217-1244.
Weak elimination of imaginaries for Boolean algebras.Roman Wencel - 2005 - Annals of Pure and Applied Logic 132 (2-3):247-270.
Cut-Elimination in the Strict Intersection Type Assignment System is Strongly Normalizing.Steffen van Bakel - 2004 - Notre Dame Journal of Formal Logic 45 (1):35-63.
Vagueness as Semantic Indecision: Metaphysical Vagueness vs Indeterminate Reference.Dan López de Sa - 2013 - Metaphysica 14 (2):197-209.
A characterization of ML in many-sorted arithmetic with conditional application.M. D. G. Swaen - 1992 - Journal of Symbolic Logic 57 (3):924 - 953.
The Hauptsatz for Stratified Comprehension: A Semantic Proof.Marcel Crabbé - 1994 - Mathematical Logic Quarterly 40 (4):481-489.
A semantic method of elimination of some paradoxes.Eugeniusz Grodziński - 1983 - Semiotica 45 (3-4):265-274.
Non-effective Quantifier Elimination.Mihai Prunescu - 2001 - Mathematical Logic Quarterly 47 (4):557-562.
The elimination argument.Andrew M. Bailey - 2014 - Philosophical Studies 168 (2):475-482.
Unifiability in extensions of K4.Çiğdem Gencer & Dick de Jongh - 2009 - Logic Journal of the IGPL 17 (2):159-172.
Canonical Constructive Systems ⋆.Arnon Avron - unknown

Analytics

Added to PP
2009-01-28

Downloads
44 (#343,283)

6 months
6 (#417,196)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Sentence connectives in formal logic.Lloyd Humberstone - forthcoming - Stanford Encyclopedia of Philosophy.
New Consecution Calculi for R→t.Katalin Bimbó & J. Michael Dunn - 2012 - Notre Dame Journal of Formal Logic 53 (4):491-509.
Sufficient conditions for cut elimination with complexity analysis.João Rasga - 2007 - Annals of Pure and Applied Logic 149 (1-3):81-99.

View all 6 citations / Add more citations

References found in this work

Display logic.Nuel D. Belnap - 1982 - Journal of Philosophical Logic 11 (4):375-417.

View all 10 references / Add more references