From Proof Nets to the Free *-Autonomous Category

DOI10.2168/LMCS-2(4:3)2006zbMath1127.03044MaRDI QIDQ5310668

François Lamarche, Lutz Straßburger

Publication date: 11 October 2007

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

full multiplicative linear logic

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (7)

Unnamed Item ⋮ Proof Nets, Coends and the Yoneda Isomorphism ⋮ Combinatorial flows as bicolored atomic flows ⋮ System BV is NP-complete ⋮ Towards Hilbert's 24th Problem: Combinatorial Proof Invariants ⋮ The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem ⋮ Deep inference and expansion trees for second-order multiplicative linear logic

This page was built for publication: From Proof Nets to the Free *-Autonomous Category