Results 11 to 20 of about 658,878 (281)
Cut elimination in coalgebraic logics [PDF]
Information and Computation, 2008 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 ...
Pattinson, Dirk +2 more
core +7 more sources
Algebraic proofs of cut elimination
The Journal of Logic and Algebraic Programming, 2001 Algebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are presented, and are used to show how one can sometimes extract a constructive proof and an algorithm from a proof that is nonconstructive.
Jeremy Avigad
exaly +3 more sources
Cut Elimination in Multifocused Linear Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We study cut elimination for a multifocused variant of full linear logic in the sequent calculus. The multifocused normal form of proofs yields problems that do not appear in a standard focused system, related to the constraints in grouping rule ...
Taus Brock-Nannestad, Nicolas Guenot
doaj +7 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
, 2011 This is the first book on cut-elimination in first-order predicate logic from an algorithmic point of view. Instead of just proving the existence of cut-free proofs, it focuses on the algorithmic methods transforming proofs with arbitrary cuts to proofs ...
Alexander Leitsch, Matthias Baaz
exaly +3 more sources
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 +2 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'.
Luca Bellotti
core +3 more sources
Syntactic Cut-Elimination for Common Knowledge
Annals of Pure and Applied Logic, 2008 We see a cut-free infinitary sequent system for common knowledge. Its sequents are essentially trees and the inference rules apply deeply inside of these trees.
Brünnler, Kai +3 more
core +5 more sources
, 2020 In this paper we give a terminating cut-elimination procedure for a logic calculus SBL. SBL corresponds to the second order arithmetic Pi^{1}_{2}-Separation and Bar Induction.
Toshiyasu Arai
openaire +4 more sources
Towards a Semantic Characterization of Cut-Elimination [PDF]
Studia Logica, 2006 An occurrence of the cut rule in a derivation is called reductive if either (i) both cut formulas are the principal formulas of logical rules, or (ii) one of the two cut formulas is a context formula of a rule other than the cut, or (iii) one of the two premises is an identity axiom (of the form \(X\Rightarrow X\)). Reductive cut-elimination for simple
Agata Ciabattoni +2 more
exaly +3 more sources