Results 21 to 30 of about 658,878 (281)
Mathematical Structures in Computer Science, 2017 We investigate cut elimination in multi-focused sequent calculi and the impact on the cut elimination proof of design choices in such calculi. The particular design we advocate is illustrated by a multi-focused calculus for full linear logic using an ...
TAUS BROCK-NANNESTAD, NICOLAS GUENOT
core +2 more sources
Cut Elimination for the Unified Logic
Annals of Pure and Applied Logic, 1993 In the paper entitled "On the Unity of Logic", J.-Y. Girard presented a calculus, called LU, which is common to classical logic, intuitionistic logic and linear logic.
Vauzeilles, Jacqueline
core +4 more sources
Corrected upper bounds for free-cut elimination
Theoretical Computer Science, 2011 Free-cut elimination allows cut elimination to be carried out in the presence of non-logical axioms. Formulas in a proof are anchored provided they originate in a non-logical axiom or non-logical inference.
Arnold Beckmann, Samuel R Buss
exaly +2 more sources
Confluence as a cut elimination property
, 2003 The goal of this note is to compare two notions, one coming from the theory of rewrite systems and the other from proof theory: confluence and cut elimination.
Dowek, Gilles
core +5 more sources
Cut-elimination and Redundancy-elimination by Resolution
Journal of Symbolic Computation, 2000 A new cut-elimination method for Gentzen’s LK is defined. First cut-elimination is generalized to the problem of redundancy-elimination. Then the elimination of redundancy in LK-proofs is performed by a resolution method in the following way.
Leitsch, Alexander, Baaz, Matthias
core +2 more sources
Cut-Elimination for Quantified Conditional Logic
Journal of Philosophical Logic, 2017 peer reviewedA semantic embedding of quantified conditional logic in classical higher-order logic is utilized for reducing cut-elimination in the former logic to existing results for the latter logic.
BENZMÜLLER, Christoph
core +3 more sources
IMELL Cut Elimination with Linear Overhead [PDF]
Recently, Accattoli introduced the Exponential Substitution Calculus (ESC) given by untyped proof terms for Intuitionistic Multiplicative Exponential Linear Logic (IMELL), endowed with rewriting rules at-a-distance for cut elimination. He also introduced
Accattoli, Beniamino +3 more
core +5 more sources
Cut-Elimination: Experiments with CERES
, 2005 Cut-elimination is the most prominent form of proof transformation in logic. The elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical proofs. The cut-elimination method CERES (cut-elimination
Stefan Hetzl +4 more
core +2 more sources
Towards a clausal analysis of cut-elimination
Journal of Symbolic Computation, 2006 In this paper we show that a large class of cut-elimination methods can be analysed by clause terms representing sets of characteristic clauses extractable from the original proof.
Matthias Baaz, Alexander Leitsch
exaly +2 more sources
Elimination and cut-elimination in multiplicative linear logic [PDF]
, 2022 We associate to every proof structure in multiplicative linear logic an ideal which represents the logical content of the proof as polynomial equations.
Murfet, Daniel, Troiani, William
core +2 more sources