Results 41 to 50 of about 2,682,535 (254)
The Consistency and Complexity of Multiplicative Additive System Virtual [PDF]
Scientific Annals of Computer Science, 2015 This paper investigates the proof theory of multiplicative additive system virtual (MAV). MAV combines two established proof calculi: multiplicative additive linear logic (MALL) and basic system virtual (BV).
R. Horne
doaj +1 more source
Partial cut elimination for propositional discrete linear time temporal logic
Lietuvos Matematikos Rinkinys, 2010 We consider propositional discrete linear time temporal logic with future and past operators of time. For each formula ϕ of this logic, we present Gentzen-type sequent calculus Gr(ϕ) with a restricted cut rule.
Jūratė Sakalauskaitė
doaj +1 more source
Superdeduction in Lambda-Bar-Mu-Mu-Tilde [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way.
Clément Houtmann
doaj +1 more source
Cut Elimination, Substitution and Normalisation [PDF]
, 2015 R. Dyckhoff
semanticscholar +2 more sources
The Basics of Display Calculi [PDF]
, 2017 The aim of this paper is to introduce and explain display calculi for a variety of logics. We provide a survey of key results concerning such calculi, though we focus mainly on the global cut elimination theorem.
Eckhardt, Timo +3 more
core +2 more sources
Canonical calculi with (n,k)-ary quantifiers [PDF]
Logical Methods in Computer Science, 2008 Propositional canonical Gentzen-type systems, introduced in 2001 by Avron and Lev, are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly one occurrence of a connective is introduced and no ...
Arnon Avron, Anna Zamansky
doaj +1 more source
Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, 2000 Presents new proofs of cut elimination for intuitionistic, classical and linear sequent calculi. In all cases, the proofs proceed by three nested structural inductions, avoiding the explicit use of multi-sets and termination measures on sequent derivations.
openaire +1 more source
Cut elimination by unthreading
Archive for Mathematical Logic, 2023 AbstractWe provide a non-Gentzen, though fully syntactical, cut-elimination algorithm for classical propositional logic. The designed procedure is implemented on $$\textsf{GS4}$$ GS 4 , the one-sided version of Kleene’s sequent system $$\textsf{G4}$$
openaire +4 more sources
Revisiting the correspondence between cut-elimination and normalisation [PDF]
, 2000 Cut-free proofs in Herbelin's sequent calculus are in 1-1 correspondence with normal natural deduction proofs. For this reason Herbelin's sequent calculus has been considered a privileged middle-point between L-systems and natural deduction.
Espírito Santo, José
core +1 more source
Partial cut elimination for combinations of propositional multi-modal logics with past time
Lietuvos Matematikos Rinkinys, 2011 We consider combinations of nine propositional multi-modal logics with propositional discrete linear time temporal logic with past time. For these combinations, we present sound and complete Gentzen-type sequent calculi with a restricted cut rule.
Jūratė Sakalauskaitė
doaj +1 more source