Results 21 to 30 of about 578,113 (185)
Logical Methods in Computer Science, 2013 We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing.
Stefan Hetzl, Lutz Straßburger
doaj +1 more source
Reverse mathematics and well-ordering principles [PDF]
, 2011 The paper is concerned with generally Pi^1_2 sentences of the form 'if X is well ordered then f(X) is well ordered', where f is a standard proof theoretic function from ordinals to ordinals.
Rathjen, Michael, Weiermann, Andreas
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
Semantic A-translation and Super-consistency entail Classical Cut Elimination [PDF]
, 2013 We show that if a theory R defined by a rewrite system is super-consistent, the classical sequent calculus modulo R enjoys the cut elimination property, which was an open question.
Lisa Allali +2 more
core +5 more sources
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
The Epsilon Calculus and Herbrand Complexity [PDF]
, 2005 Hilbert's epsilon-calculus is based on an extension of the language of predicate logic by a term-forming operator $\epsilon_{x}$. Two fundamental results about the epsilon-calculus, the first and second epsilon theorem, play a role similar to that which ...
A. Blass +20 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
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
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