DeepAI AI Chat
Log In Sign Up

Super Exponentials in Linear Logic

by   Esaïe Bauer, et al.
ENS Lyon

Following the idea of Subexponential Linear Logic and Stratified Bounded Linear Logic, we propose a new parameterized version of Linear Logic which subsumes other systems like ELL, LLL or SLL, by including variants of the exponential rules. We call this system Superexponential Linear Logic (superLL). Assuming some appropriate constraints on the parameters of superLL, we give a generic proof of cut elimination. This implies that each variant of Linear Logic which appears as a valid instance of superLL also satisfies cut elimination.


page 1

page 2

page 3

page 4


Elimination and cut-elimination in multiplicative linear logic

We associate to every proof structure in multiplicative linear logic an ...

A Simple Proof That Super-Consistency Implies Cut Elimination

We give a simple and direct proof that super-consistency implies the cut...

Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents

This paper employs the recently introduced linear nested sequent framewo...

Stellar Resolution: Multiplicatives – for the linear logician, through examples

The stellar resolution is an asynchronous model of computation used in G...

An application of parallel cut elimination in multiplicative linear logic to the Taylor expansion of proof nets

We examine some combinatorial properties of parallel cut elimination in ...

Subatomic systems need not be subatomic

Subatomic systems were recently introduced to identify the structural pr...

Merging Knockout and Round-Robin Tournaments: A Flexible Linear Elimination Tournament Design

We propose a new tournament structure that combines the popular knockout...