Results 11 to 20 of about 580,256 (322)
Generating facets for the cut polytope of a graph by triangular elimination [PDF]
Mathematical Programming, 2006 The cut polytope of a graph arises in many fields. Although much is known about facets of the cut polytope of the complete graph, very little is known for general graphs. The study of Bell inequalities in quantum information science requires knowledge of
Avis, David +2 more
core +7 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 +6 more sources
Algebraic Aspects of Cut Elimination [PDF]
Studia Logica, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Belardinelli, Francesco +2 more
exaly +4 more sources
Schematic Cut elimination and the Ordered Pigeonhole Principle [Extended Version] [PDF]
, 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 +2 more sources
Elimination and cut-elimination in multiplicative linear logic [PDF]
, 2022 We associate to every proof structure in multiplicative linear logic an ideal which represents the logical content of the proof as polynomial equations. We show how cut-elimination in multiplicative proof nets corresponds to instances of the Buchberger algorithm for computing Gröbner bases in elimination theory.
Murfet, Daniel, Troiani, William
openaire +3 more sources
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 +3 more sources
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic [PDF]
Logical Methods in Computer Science, 2023 This paper introduces the exponential substitution calculus (ESC), a new presentation of cut elimination for IMELL, based on proof terms and building on the idea that exponentials can be seen as explicit substitutions.
Beniamino Accattoli
doaj +1 more source
An application of parallel cut elimination in multiplicative linear logic to the Taylor expansion of proof nets [PDF]
Logical Methods in Computer Science, 2021 We examine some combinatorial properties of parallel cut elimination in multiplicative linear logic (MLL) proof nets. We show that, provided we impose a constraint on some paths, we can bound the size of all the nets satisfying this constraint and ...
Jules Chouquet, Lionel Vaux Auclair
doaj +1 more source
Cut-Free Gentzen Sequent Calculi for Tense Logics
Axioms, 2023 The cut-free single-succedent Gentzen sequent calculus GKt for the minimal tense logic Kt is introduced. This sequent calculus satisfies the displaying property.
Zhe Lin, Minghui Ma
doaj +1 more source
The Structure of Differential Invariants and Differential Cut Elimination [PDF]
Logical Methods in Computer Science, 2012 The biggest challenge in hybrid systems verification is the handling of differential equations. Because computable closed-form solutions only exist for very simple differential equations, proof certificates have been proposed for more scalable ...
Andre Platzer
doaj +1 more source