Linear time proof verification on N-graphs: a graph theoretic approach

DOI10.1007/978-3-642-39992-3_7MaRDI QIDQ2849421zbMATH OpenOpenAlexFDO

Authors Laís Andrade, Ruan Carvalho, Anjolina de Oliveira, Ruy J. G. B. de Queiroz

Publication date 17 September 2013

Published in Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39992-3_7

zbMATH Keywords

\(\mathrm{MLL}^{ - }\)automatic proof-checkingclassical logicDFSgraph theorylinear logicN-graphsnatural deduction

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Structure of proofs (03F07)

Recommendations

• A linear algorithm for MLL proof net correctness and sequentialization
• A new correctness criterion for the proof nets of non-commutative multiplicative linear logics
• Intuitionistic N-graphs
• Fast verification of MLL proof nets via IMLL
• Logic beyond formulas: a proof system on graphs

Cited in

(1)

• Normalization of N-graphs via sub-N-graphs

This page was built for publication: Linear time proof verification on N-graphs: a graph theoretic approach

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