
doi: 10.2307/2695028
handle: 11564/109297 , 11384/72497
AbstractIn 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 (and weakening and contraction as well) 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”.
sequent calculus, Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics), noncommutative linear logic with exponentials, Proof-theoretic aspects of linear logic and other substructural logics, logic without structural rules, Cut-elimination and normal-form theorems, cut elimination, saturated formulas
sequent calculus, Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics), noncommutative linear logic with exponentials, Proof-theoretic aspects of linear logic and other substructural logics, logic without structural rules, Cut-elimination and normal-form theorems, cut elimination, saturated formulas
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
