Results 11 to 20 of about 118,600 (325)

Cut-elimination for the mu-calculus with one variable [PDF]

Electronic Proceedings in Theoretical Computer Science, 2012
We establish syntactic cut-elimination for the one-variable fragment of the modal mu-calculus. Our method is based on a recent cut-elimination technique by Mints that makes use of Buchholz' Omega-rule.
Grigori Mints, Thomas Studer
doaj   +3 more sources

Cut-elimination and Redundancy-elimination by Resolution [PDF]

Journal of Symbolic Computation, 2000
The authors propose a new cut-elimination procedure for classical predicate calculus LK. The basic formulation treats a particular case: \[ \text{if }A,\Gamma\vdash\Delta\text{ is derivable and }A\text{ is valid, then }\Gamma\vdash\Delta\text{ is derivable}.\tag{\(*\)} \] In general a cut like \(\Gamma\vdash B\); \(B,\Gamma\vdash\Delta/\Gamma \vdash ...
Matthias Baaz, Alexander Leitsch
openaire   +2 more sources

Syntactic cut-elimination for common knowledge [PDF]

Annals of Pure and Applied Logic, 2009
The logic of common knowledge has been formulated by Alberucci and Jäger in a sequential system with a rule of infinite premises so as to enjoy completeness, from which then follows the cut-elimination theorem indirectly. There are also several variations of the logic formulated in cut-free sequential systems but a syntactical cut-elimination proof has
Kai Brünnler, Thomas Studer
openaire   +5 more sources

Generic Modal Cut Elimination Applied to Conditional Logics [PDF]

Logical Methods in Computer Science, 2011
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide
Dirk Pattinson, Lutz Schröder
doaj   +3 more sources

Tautology Elimination, Cut Elimination, and S5 [PDF]

Logic and Logical Philosophy, 2017
Tautology elimination rule was successfully applied in automated deduction and recently considered in the framework of sequent calculi where it is provably equivalent to cut rule. In this paper we focus on the advantages of proving admissibility of tautology elimination rule instead of cut for sequent calculi.
Indrzejczak, Andrzej
openaire   +5 more sources

Novikov's Cut Elimination [PDF]

Logique et Analyse, 2018
This is an exposition of Novikov's cut-elimination procedure for a Hilbert-style formulation of the first-order predicate calculus, which depends on a property of formulas introduced by him, called 'regularity'. A comparison with other methods is outlined.
Luca Bellotti
openaire   +4 more sources

Confluence as a Cut Elimination Property [PDF]

, 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. We show that to each rewrite system on terms, we can associate a logical system: asymmetric deduction modulo this rewrite system and that the confluence property of the rewrite system is ...
Dowek, Gilles
core   +9 more sources

Cut elimination for the unified logic [PDF]

Annals of Pure and Applied Logic, 1993
The Unified Logic, \(\text{\textbf{LU}}\), is introduced by \textit{J.-Y. Girard} [ibid. 59, 201-217 (1993; Zbl 0781.03044)]. Its sequent is of the form \(\Gamma;\Gamma'\lvdash \Delta';\Delta\), where the outer zone \(\langle\Gamma,\Delta\rangle\) has the linear logic maintenance, and the inner \(\langle\Gamma',\Delta'\rangle\) the classical one. Among
Vauzeilles, Jacqueline
openaire   +4 more sources

Tautology Elimination, Cut Elimination and S4? [PDF]

Logic and Logical Philosophy
The paper “Tautology elimination, cut elimination, and S5” published in this journal presents a novel method for establishing by proof analysis the admissibility of the rule of tautology elimination for certain sequent calculi. Since tautology elimination will typically imply the admissibility of cut, the method promises a new path to show the ...
Fjellstad, Andreas
openaire   +4 more sources

Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic [PDF]

Logical Methods in Computer Science, 2023
This paper introduces the exponential substitution calculus (ESC), a new presentation of cut elimination for IMELL, based on proof terms and building on the idea that exponentials can be seen as explicit substitutions.
Beniamino Accattoli
doaj   +1 more source