Simple multiplicative proof nets with units
arXiv:math/0507003
Abstract
This paper presents a simple notion of proof net for multiplicative linear logic with units. Cut elimination is direct and strongly normalising, in contrast to previous approaches which resorted to moving jumps (attachments) of par units during normalisation. Composition in the resulting category of proof nets is simply path composition: all of the dynamics happens in GoI(Setp), the geometry-of-interaction construction applied to the category of sets and partial functions.
13 pages. Submitted for publication, March 5, 2005
Cited by in corpus (8)
- From Proof Nets to the Free *-Autonomous Category
- Proof equivalence in MLL is PSPACE-complete
- Coherence for Frobenius pseudomonoids and the geometry of linear proofs
- Linear Logic without Units
- Simple free star-autonomous categories and full coherence
- Surface Proofs for Nonsymmetric Linear Logic (Extended Abstract)
- MALL proof equivalence is Logspace-complete, via binary decision diagrams
- Exponentially Handsome Proof Nets and Their Normalization