A Deep Inference System for Differential Linear Logic

12/30/2021
by   Matteo Acclavio, et al.
0

Differential linear logic (DiLL) provides a fine analysis of resource consumption in cut-elimination. We investigate the subsystem of DiLL without promotion in a deep inference formalism, where cuts are at an atomic level. In our system every provable formula admits a derivation in normal form, via a normalization procedure that commutes with the translation from sequent calculus to deep inference.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/02/2019

Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (Extended version)

We give a linear nested sequent calculus for the basic normal tense logi...
research
08/07/2016

Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities

The Lambek calculus can be considered as a version of non-commutative in...
research
10/15/2019

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

This paper employs the recently introduced linear nested sequent framewo...
research
04/14/2022

Normalization by Evaluation for the Lambek Calculus

The syntactic calculus of Lambek is a deductive system for the multiplic...
research
12/30/2021

Super Exponentials in Linear Logic

Following the idea of Subexponential Linear Logic and Stratified Bounded...
research
04/03/2019

Predicative proof theory of PDL and basic applications

Propositional dynamic logic (PDL) is presented in Schütte-style mode as ...
research
01/26/2021

Proof Theory of Partially Normal Skew Monoidal Categories

The skew monoidal categories of Szlachányi are a weakening of monoidal c...

Please sign up or login with your details

Forgot password? Click here to reset