Sequents and link graphs : contraction criteria for refinements of multiplicative linear logic

In this thesis we investigate certain structural refinements of multiplicative linear logic, obtained by removing structural rules like commutativity and associativity, in addition to the removal of weakening and contraction, which characterizes linear logic. We define a notion of sequent that is able to capture these subtle structural distinctions. For each of our calculi (MLL, NCLL, CNL, and N