Non-normal modalities in variants of Linear Logic
Daniele Porello, Nicolas Troquard

TL;DR
This paper develops modal extensions of Linear Logic with a non-normal modality, providing sound and complete proof systems, and applies it to reasoning about resource-sensitive agency and artefacts.
Contribution
It introduces a novel modal Linear Logic framework with non-normal modalities, complete proof systems, and applications to agency and resource management.
Findings
Proof systems are sound and complete for the proposed logics.
Sequent calculus admits cut elimination and has PSPACE proof search complexity.
The framework can be extended to non-commutative connectives and applied to agency reasoning.
Abstract
This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of Linear Logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have shown that the results scale up to logics with multiple non-minimal modalities. Here, we start with the language of propositional intuitionistic Linear Logic without the additive disjunction, to which we add a modality. We provide an interpretation of this language on a class of Kripke resource models extended with a neighbourhood function: modal Kripke resource models. We propose a Hilbert-style axiomatization and a Gentzen-style sequent calculus. We show that the proof theories are sound and complete with respect to the class of modal Kripke resource models. We show that the sequent calculus admits cut elimination and that proof-search is in PSPACE.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
