Some remarks on cyclic linear logic preliminary report
François Métayer · Electronic Notes in Theoretical Computer Science · 1996
We study three fragments of multiplicative linear logic with circular exchange, respectively LLNC containing all propositional variables, LLNCa builded on a single variable and the constant-only fragment LLNC0. By using non-commutative proofnets, we show that the decision problems of these fragments are polynomially equivalent.