Results 51 to 60 of about 578,113 (185)
Algebraic proofs of cut elimination
The Journal of Logic and Algebraic Programming, 2001 Jeremey Avigad. Algebraic Proofs of Cut Elimination.
openaire +1 more source
Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination [PDF]
, 1996 This paper is intended to provide an introduction to cut elimination which is accessible to a broad mathematical audience. Gentzen's cut elimination theorem is not as well known as it deserves to be, and it is tied to a lot of interesting mathematical ...
Carbone, Alessandra, Semmes, S.
core +1 more source
Elimination of Cuts in First-order Finite-valued Logics [PDF]
, 1993 A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established.
Baaz, Matthias +2 more
core +4 more sources
On intuitionistic branching tense logic with weak induction
Lietuvos Matematikos Rinkinys, 1998 In the paper, the first-order branching tense logic calculus is given: LB J with the weak induction, that is to say with the axiom (A ∧ A O ☐ A) ⊃ ☐ A instead of the induction axiom (A ∧ ☐ (A ⊃ O A)) ⊃ ☐ A.
Romas Alonderis
doaj +3 more sources
Logical Methods in Computer Science, 2017 We propose new sequent calculus systems for orthologic (also known as minimal quantum logic) which satisfy the cut elimination property. The first one is a simple system relying on the involutive status of negation. The second one incorporates the notion
Olivier Laurent
doaj +1 more source
Taylor expansion in linear logic is invertible [PDF]
Logical Methods in Computer Science, 2018 Each Multiplicative Exponential Linear Logic (MELL) proof-net can be expanded into a differential net, which is its Taylor expansion. We prove that two different MELL proof-nets have two different Taylor expansions.
Daniel de Carvalho
doaj +1 more source
Algorithmic Introduction of Quantified Cuts
, 2014 We describe a method for inverting Gentzen's cut-elimination in classical first-order logic. Our algorithm is based on first computign a compressed representation of the terms present in the cut-free proof and then cut-formulas that realize such a ...
Hetzl, Stefan +3 more
core +2 more sources
Schematic Cut elimination and the Ordered Pigeonhole Principle [Extended Version]
, 2016 In previous work, an attempt was made to apply the schematic CERES method [8] to a formal proof with an arbitrary number of {\Pi} 2 cuts (a recursive proof encapsulating the infinitary pigeonhole principle) [5].
Cerna, David, Leitsch, Alexander
core +1 more source
Cut-elimination and Normalization Theorems for Connexive Logics over Wansing’s C
Bulletin of the Section of LogicGentzen-style sequent calculi and Gentzen-style natural deduction systems are introduced for a family (C-family) of connexive logics over Wansing’s basic constructive connexive logic C.
Norihiro Kamide
doaj +1 more source
Elimination of Cucumber mosaic virus from gladiolus by meristem tip culture, thermotherapy and electrotherapy [PDF]
مجله بیوتکنولوژی کشاورزی, 2016 Flowers of Gladiolus sp. are among the top six flowers of export value and in Iran take the second place in the production of cut flowers. Cucumber mosaic virus is one of the most common viruses in gladiolus worldwide.
Sorraya Tourang +2 more
doaj +1 more source