Labelled Connection-based Proof Search for Multiplicative Intuitionistic

We propose a connection-based characterization for multiplicative intuitionistic linear logic (MILL) which is based on labels and constraints that capture Urquhart's possible world semantics of the logic. We rst brie y recall the purely syntactic sequent calculus for MILL, which we call LMILL. Then, in the spirit of our previous results on the Logic of Bunched Implications (BI), we present a connection-based characterization of MILL provability. We show its soundness and completeness without the need for any notion of multiplicity. From the characterization, we nally propose a labelled sequent calculus for MILL.