On Structuring Proof Search for First Order Linear Logic

We start from the Forum presentation of first order linear logic to design an equivalent system for which proof search is highly structured. We restrict formulae to a language of clauses and goals, without losing expressivity, in such a way that formulae have the same structure of Forum sequents. This means having a very big generalised connective that suffices for al l of linear logic. We can then design a system with only two big rules, a left one and a right one. The behaviour of such system in proof search is operational ly interesting and makes it suitable for further semantic investigations. We test the mutual harmony of the new rules by showing a cut elimination theorem.