Paper Info
Title
MALL proof nets identify proofs modulo rule commutation.
Abstract
We show that the proof nets introduced in [Hughes u0026 van Glabbeek 2003, 2005] for MALL (Multiplicative Additive Linear Logic, without units) identify cut-free proofs modulo rule commutation: two cut-free proofs translate to the same proof net if and only if one can be obtained from the other by a succession of rule commutations. This result holds with and without the mix rule, and we extend it with cut.
Year
Venue
Field
2016
arXiv: Logic in Computer Science
Discrete mathematics,Multiplicative function,Modulo,Algorithm,Mathematical proof,If and only if,Linear logic,Mathematics,Commutation,Proof net
DocType
Volume
Citations 
Journal
abs/1609.04693
0
PageRank 
References 
Authors
0.34
4
2
Name
Order
Citations
PageRank
Rob J. van Glabbeek11930134.34
Dominic J. D. Hughes219312.45