Simple multiplicative proof nets with units

Simple item page
dc.creatorHughes, Dominic
dc.date2005-07-01
dc.date.accessioned2026-07-07T05:21:17Z
dc.date.available2026-07-07T05:21:17Z
dc.descriptionThis 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.
dc.description13 pages. Submitted for publication, March 5, 2005
dc.identifierhttps://arxiv.org/abs/math/0507003
dc.identifierhttp://arxiv.org/abs/math/0507003
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75635
dc.subjectLogic
dc.subjectCategory Theory
dc.subject03B47 03F52
dc.titleSimple multiplicative proof nets with units
dc.typetext

Files

Collections

arXiv