Results 11 to 20 of about 772,618 (287)
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
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
Cut elimination in coalgebraic logics [PDF]
Information and Computation, 2010 We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomatisation of a particular logic and its coalgebraic semantics that guarantee that the cut-rule is admissible in the ensuing sequent calculus.
Dirk Pattinson, Lutz Schröder
core +7 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
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
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
The Role of Quantifier Alternations in Cut Elimination [PDF]
Notre Dame Journal of Formal Logic, 2003 Extending previous results from the author's master's thesis, subsequently published in the proceedings of CSL 2003, on the complexity of cut elimination for the sequent calculus LK, we discuss the role of quantifier alternations and develop a measure to describe the complexity of cut elimination in terms of quantifier alternations in cut formulas and ...
Gerhardy, Philipp
openaire +6 more sources
Simplified cut elimination for Kripke-Platek set theory [PDF]
, 2022 The purpose of this article is to present a new and simplified cut elimination procedure for KP. We start off from the basic language of set theory and add constants for all elements of the constructible hierarchy up to the Bachmann-Howard ordinal ψ(εΩ+1)
Jäger, Gerhard
core +1 more source
The Structure of Differential Invariants and Differential Cut Elimination [PDF]
Logical Methods in Computer Science, 2012 The biggest challenge in hybrid systems verification is the handling of differential equations. Because computable closed-form solutions only exist for very simple differential equations, proof certificates have been proposed for more scalable ...
Andre Platzer
doaj +1 more source