Results 41 to 50 of about 118,600 (325)
Syntactic cut-elimination for a fragment of the modal mu-calculus [PDF]
, 2012 For some modal fixed point logics, there are deductive systems that enjoy syntactic cut-elimination. An early example is the system in Pliuskevicius (1991) [15] for LTL.
Brünnler, Kai, Studer, Thomas
core +1 more source
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
Modular cut-elimination: Finding proofs or counterexamples [PDF]
, 2006 . Modular cut-elimination is a particular notion of ”cut-elimination in the presence of non-logical axioms ” that is preserved under the addition of suitable rules.
Ciabattoni, Agata +3 more
core +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
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
Pattern matching as cut elimination
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cerrito, Serenella, Kesner, Delia
openaire +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
Analytic Non-Labelled Proof-Systems for Hybrid Logic: Overview and a couple of striking facts
Bulletin of the Section of Logic, 2022 This paper is about non-labelled proof-systems for hybrid logic, that is, proofsystems where arbitrary formulas can occur, not just satisfaction statements.
Torben Braüner
doaj +1 more source
On Multiplicative Linear Logic, Modality and Quantum Circuits [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 A logical system derived from linear logic and called QMLL is introduced and shown able to capture all unitary quantum circuits. Conversely, any proof is shown to compute, through a concrete GoI interpretation, some quantum circuits.
Ugo Dal Lago, Claudia Faggian
doaj +1 more source
Cut-Elimination and Quantification in Canonical Systems [PDF]
Studia Logica, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anna Zamansky, Arnon Avron
openaire +1 more source