Super Exponentials in Linear Logic

12/30/2021
by   Esaïe Bauer, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/22/2022

Elimination and cut-elimination in multiplicative linear logic

We associate to every proof structure in multiplicative linear logic an ...
research
04/21/2023

A Simple Proof That Super-Consistency Implies Cut Elimination

We give a simple and direct proof that super-consistency implies the cut...
research
08/15/2023

Infinitary cut-elimination via finite approximations

We investigate non-wellfounded proof systems based on parsimonious logic...
research
09/04/2023

Multirole Logic and Multiparty Channels

We identify multirole logic as a new form of logic in which conjunction/...
research
02/14/2019

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 ...
research
12/07/2020

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

The stellar resolution is an asynchronous model of computation used in G...
research
12/30/2021

A Deep Inference System for Differential Linear Logic

Differential linear logic (DiLL) provides a fine analysis of resource co...

Please sign up or login with your details

Forgot password? Click here to reset