Explorations in Subexponential non-associative non-commutative Linear Logic (extended version)
Logic in Computer Science
2023-07-24 v2 Logic
Abstract
In a previous work we introduced a non-associative non-commutative logic extended by multimodalities, called subexponentials, licensing local application of structural rules. Here, we further explore this system, considering a classical one-sided multi-succedent classical version of the system, following the exponential-free calculi of Buszkowski's and de Groote and Lamarche's works, where the intuitionistic calculus is shown to embed faithfully into the classical fragment.
Cite
@article{arxiv.2307.03059,
title = {Explorations in Subexponential non-associative non-commutative Linear Logic (extended version)},
author = {Eben Blaisdell and Max I. Kanovich and Stepan L. Kuznetsov and Elaine Pimentel and Andre Scedrov},
journal= {arXiv preprint arXiv:2307.03059},
year = {2023}
}