output
20182022
most citedA System of Interaction and Structure III: The Complexity of BV and Pomset Logic

5 citations

Showing cs.LOShow all

5 papers · 1 filter

cs.LO2022★ 5 cited

A System of Interaction and Structure III: The Complexity of BV and Pomset Logic

Lê Thành Dũng Nguyên, Lutz Straßburger

Pomset logic and BV are both logics that extend multiplicative linear logic (with Mix) with a third connective that is self-dual and non-commutative. Whereas pomset logic originate…

cs.LO2022★ 4 cited

Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic

Beniamino Accattoli

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…

cs.LO2022

Reasonable Space for the -Calculus, Logarithmically

Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni

Can the -calculus be considered a reasonable computational model? Can we use it for measuring the time space consumption of algorithms? While the literature conta…

cs.LO2021

Combinatorial Proofs and Decomposition Theorems for First-order Logic

Dominic Hughes, Lutz Straßburger, Jui-Hsuan Wu

We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof sy…

cs.LO2020★ 5 cited

An Analytic Propositional Proof System on Graphs

Matteo Acclavio, Ross Horne, Lutz Straßburger

In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-co…