Fast verification of MLL proof nets via IMLL

DOI10.1145/1149114.1149116MaRDI QIDQ5277754zbMATH OpenOpenAlexFDO

Authors

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/1149114.1149116

zbMATH Keywords

disjoint union finddominator treesessential netsmultiplicative linear logicproof nets

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A linear algorithm for MLL proof net correctness and sequentialization
• Sequent reconstruction in LLM -- A sweepline proof
• Correctness of Multiplicative (and Exponential) Proof Structures is NL-Complete
• scientific article; zbMATH DE number 1324433
• A coding theoretic study of MLL proof nets

Cited in

(7)

• A formal model for a linear time correctness condition of proof nets of multiplicative linear logic
• Linear time proof verification on N-graphs: a graph theoretic approach
• A coding theoretic study of MLL proof nets
• Completeness of MLL proof-nets w.r.t. weak distributivity
• scientific article; zbMATH DE number 7359421 (Why is no real title available?)
• Correctness of linear logic proof structures is NL-complete
• A linear algorithm for MLL proof net correctness and sequentialization

This page was built for publication: Fast verification of MLL proof nets via IMLL

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