Proof nets for unit-free multiplicative-additive linear logic

DOI10.1145/1094622.1094629zbMath1367.03111OpenAlexW1964454590MaRDI QIDQ5277740

Dominic J. D. Hughes, Robert J. van Glabbeek

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1094622.1094629

zbMATH Keywords

additivescut eliminationlinear logicproof nets

Mathematics Subject Classification ID

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

Related Items (17)

Softness of MALL proof-structures and a correctness criterion with Mix ⋮ Cyclic Multiplicative Proof Nets of Linear Logic with an Application to Language Parsing ⋮ Judgement aggregation in non-classical logics ⋮ A proof of the focusing theorem via MALL proof nets ⋮ An approach to innocent strategies as graphs ⋮ Unnamed Item ⋮ Proof nets for multiplicative cyclic linear logic and Lambek calculus ⋮ Representation of partial traces ⋮ The logic of message-passing ⋮ Proof nets sequentialisation in multiplicative linear logic ⋮ Towards Hilbert's 24th Problem: Combinatorial Proof Invariants ⋮ Correctness of linear logic proof structures is NL-complete ⋮ Softness of hypercoherences and MALL full completeness ⋮ Unnamed Item ⋮ Cyclic Multiplicative-Additive Proof Nets of Linear Logic with an Application to Language Parsing ⋮ Event Domains, Stable Functions and Proof-Nets ⋮ Unnamed Item

This page was built for publication: Proof nets for unit-free multiplicative-additive linear logic