In this paper we show how to use classical linear logic as a logical framework to specify sequent calculus proof systems and to establish some simple consequences of the specified sequent calculi.Expand

We propose the proof system SELL$^\Cap$, which extends linear logic with subexponentials with quantifiers over subexponsentials, therefore allowing for the specification of concurrent systems with timed, spatial, and epistemic modalities.Expand

In this work, we explore the connections between (linear) nested sequent calculi and ordinary sequENT calculi for normal and non-normal modal logics.Expand

We propose a notion of focusing for nested sequent calculi for modal logics which brings down the complexity of proof search to that of the corresponding sequENT calculi.Expand

In previous works we have shown that linear logic with subexponentials (SELL), a refinement of linear logic, can be used to specify emergent features of concurrent constraint programming (CCP) languages, such as preferences and spatial, epistemic and temporal modalities.Expand

We show a semantical characterisation of intuitionistic, normal and non-normal modal logics for all these systems, via a case-by-case translation between labelled nested to labelled sequent systems.Expand

A new complete characterization of ?-strong normalization is given, both in the classical and in the lazy ?-calculus, through the notion of potential valuability inside two suitable parametric… Expand

We identify general conditions under which a nested calculus can be transformed into a sequent calculus by restructuring the nested sequent derivation (proof) and shedding extraneous information to obtain a derivation of the same formula.Expand