Conflict nets

DOI10.1145/2933575.2934559zbMATH Open1395.03037OpenAlexW2488003724WikidataQ130878622 ScholiaQ130878622MaRDI QIDQ4635901FDOQ4635901

Authors: Willem Heijltjes, Dominic J. D. Hughes 

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

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

Recommendations

• Computer Science Logic
• Trace nets and conflict-free computations
• Proof nets and the complexity of processing center embedded constructions
• Computer Science Logic
• scientific article; zbMATH DE number 1852171
• Publication:4896506
• Proof nets for the multimodal Lambek calculus
• Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs
• Canonical proof nets for classical logic

zbMATH Keywords

linear logicproof netsmultiplicative-additive linear logicMALL

Mathematics Subject Classification ID

Structure of proofs (03F07) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Cited In (4)

• Proof nets for unit-free multiplicative-additive linear logic
• Unification nets: canonical proof net quantifiers
• Title not available (Why is that?)
• Coherent interaction graphs

This page was built for publication: Conflict nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635901)