No proof nets for MLL with units

DOI10.1145/2603088.2603126zbMath1395.03036arXiv1510.06178OpenAlexW2128713292MaRDI QIDQ4635635

Willem Heijltjes, Robin Houston

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.06178

zbMATH Keywords

linear logicproof netsPSPACE-completenessconstraint logicproof equivalence

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (10)

Weak units, universal cells, and coherence via universality for bicategories ⋮ Unnamed Item ⋮ Reconfiguration in bounded bandwidth and tree-depth ⋮ Proof Nets, Coends and the Yoneda Isomorphism ⋮ Unnamed Item ⋮ The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem ⋮ Unnamed Item ⋮ Deep inference and expansion trees for second-order multiplicative linear logic ⋮ Unnamed Item ⋮ Proof diagrams for multiplicative linear logic: syntax and semantics

This page was built for publication: No proof nets for MLL with units