Beschreibung:
<jats:title>Abstract</jats:title><jats:p>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 <jats:italic>A</jats:italic> for which exchange rules (and weakening and contraction as well) are admissible is provably equivalent to? <jats:italic>A</jats:italic>. This property shows that the expressive power of “noncommutative exponentials” is much more important than that of “commutative exponentials”.</jats:p>