Abstract
We study a system, called NEL, which is themixed commutative/noncommutative linear logic BV augmented with linear logic's exponentials. Equivalently, NEL is MELL augmented with the noncommutative self-dual connective seq. In this article,we show a basic compositionality property ofNEL,which we call decomposition. This result leads to a cut-elimination theorem, which is proved in the next article of this series. To control the induction measure for the theorem, we rely on a novel technique that extracts from NEL proofs the structure of exponentials, into what we call !-?-Flow-Graphs.
| Original language | English |
|---|---|
| Article number | 23 |
| Journal | ACM Transactions on Computational Logic |
| Volume | 12 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Jul 2011 |
Keywords
- !-?-flow-graphs
- Calculus of structures
- Cut elimination
- Decomposition
- Deep inference
- Linear logic
- Noncommutativity