Author:
Blaisdell Eben,Kanovich Max,Kuznetsov Stepan L.,Pimentel Elaine,Scedrov Andre
Abstract
AbstractAdding multi-modalities (called subexponentials) to linear logic enhances its power as a logical framework, which has been extensively used in the specification of e.g. proof systems, programming languages and bigraphs. Initially, subexponentials allowed for classical, linear, affine or relevant behaviors. Recently, this framework was enhanced so to allow for commutativity as well. In this work, we close the cycle by considering associativity. We show that the resulting system ($$\mathsf {acLL}_\varSigma $$
acLL
Σ
) admits the (multi)cut rule, and we prove two undecidability results for fragments/variations of $$\mathsf {acLL}_\varSigma $$
acLL
Σ
.
Publisher
Springer International Publishing
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Explorations in Subexponential Non-associative Non-commutative Linear Logic;Electronic Proceedings in Theoretical Computer Science;2023-08-07
2. Diamonds Are Forever;Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021);2023