Abstract

In this paper, we show by a proof-theoretical argument that in a logic without structural rules, that is in noncommutative linear logic with exponentials, every formula A for which exchange rules are admissible is provably equivalent to?A. This property shows that the expressive power of "noncommutative exponentials" is much more important than that of "commutative exponentials".