Non-normal modalities in variants of Linear Logic

by   Daniele Porello, et al.

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. We then show how to extend the results when non-commutative connectives are added to the language. Finally, we put the logical framework to use by instantiating it as logics of agency. In particular, we propose a logic to reason about the resource-sensitive use of artefacts and illustrate it with a variety of examples.



There are no comments yet.


page 1

page 2

page 3

page 4


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...

A journey in modal proof theory: From minimal normal modal logic to discrete linear temporal logic

Extending and generalizing the approach of 2-sequents (Masini, 1992), we...

Fitch-Style Modal Lambda Calculi

Fitch-style modal deduction, in which modalities are eliminated by openi...

A Linear-logical Reconstruction of Intuitionistic Modal Logic S4

We propose a "modal linear logic" to reformulate intuitionistic modal lo...

Separability and harmony in ecumenical systems

The quest of smoothly combining logics so that connectives from classica...

On Kinds of Indiscernibility in Logic and Metaphysics

Using the Hilbert-Bernays account as a spring-board, we first define fou...

The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities

We give a proof-theoretic and algorithmic complexity analysis for system...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.