Simple multiplicative proof nets with units
Logic
2007-05-23 v1 Category Theory
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.
Cite
@article{arxiv.math/0507003,
title = {Simple multiplicative proof nets with units},
author = {Dominic Hughes},
journal= {arXiv preprint arXiv:math/0507003},
year = {2007}
}
Comments
13 pages. Submitted for publication, March 5, 2005