Abstract
A cornerstone of the theory of proof nets for unit-freemultiplicative linear logic (MLL) is the abstract representation of cut-freeproofs modulo inessential commutations of rules. The only knownextension to additives, based on monomial weights, fails topreserve this key feature: a host of cut-free monomial proof nets cancorrespond to the same cut-free proof. Thus the problem offinding a satisfactory notion of proof net for unit-freemultiplicative-additive linear logic (MALL) has remained open since theincep-tion of linear logic in 1986. We present a new definition of MALLproof net which remains faithful to the cornerstone of the MLLtheory.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
