1 Introduction: the interest of proof nets for categorial grammar There are both linguistic and mathematical reasons for studying proof nets the perspective of categorial grammar. It is now well known that the Lambek calculus corresponds to intuitionnistic non-commutative multiplicative linear logic — with no empty antecedent, to be absolutely precise. As natural deduction underlines the constructive contents of intuitionistic

We present a full completeness theorem for the multiplicative fragment of a variant of noncommutative linear logic, Yetter's cyclic linear logic (CyLL). The semantics is obtained by interpreting proofs as dinatural transformations on a category of topological vector spaces, these transformations being equivariant under certain actions of a noncocommutative Hopf algebra called the shuffle algebra. Multiplicative sequents are assigned a vector space of such dinaturals, and we show that this space has as a basis the denotations of cut-free proofs in CyLL+MIX. This can be viewed as a fully faithful representation of a free *-autonomous category, canonically enriched over vector spaces. This paper

We introduce non-associative linear logic, which may be seen as the classical version of the non-associative Lambek calculus. We define its sequent calculus, its theory of proof nets, for which we give a correctness criterion and a sequentialization theorem, and we show proof search in it is polynomial.