Explorations in Subexponential Non-associative Non-commutative Linear Logic
Logic in Computer Science
2023-08-11 v1
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, exhibiting a classical one-sided multi-succedent classical analogue of our intuitionistic system, following the exponential-free calculi of Buszkowski, and de Groote, Lamarche. A large fragment of the intuitionistic calculus is shown to embed faithfully into the classical fragment.
Cite
@article{arxiv.2308.05537,
title = {Explorations in Subexponential Non-associative Non-commutative Linear Logic},
author = {Eben Blaisdell and Max Kanovich and Stepan L. Kuznetsov and Elaine Pimentel and Andre Scedrov},
journal= {arXiv preprint arXiv:2308.05537},
year = {2023}
}
Comments
In Proceedings AMSLO 2023, arXiv:2308.03679