Abstract
The calculus of structures is a new proof theoretical formalism, like natural deduction, the sequent calculus and proof nets, for specifying logical systems syntactically. In a rule in the calculus of structures, the premise as well as the conclusion are structures, which are expressions that share properties of formulae and sequents. In this paper, I study a system for MELL, the multiplicative exponential fragment of linear logic, in the calculus of structures. It has the following features: a local promotion rule, no non-deterministic splitting of the context in the times rule and a modular proof for the cut elimination theorem. Further, derivations have a new property, called decomposition, that cannot be observed in any other known proof theoretical formalism.
| Original language | English |
|---|---|
| Pages (from-to) | 213-285 |
| Number of pages | 73 |
| Journal | Theoretical Computer Science |
| Volume | 309 |
| Issue number | 1-3 |
| DOIs | |
| Publication status | Published - 2 Dec 2003 |
| Externally published | Yes |
Keywords
- Calculus of structures
- Cut elimination
- Linear logic
- Proof theory
Fingerprint
Dive into the research topics of 'MELL in the calculus of structures'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver