scientific article; zbMATH DE number 786498

MaRDI QIDQ4842979zbMATH OpenFDO

Authors François Métayer

Publication date 28 November 1995

zbMATH Keywords

complexityhomologyprovabilitymultiplicative linear logicabstract graphspaired graphsvolume of a formula

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Structure of proofs (03F07)

Recommendations

• Homology of proof-nets
• Correctness of Multiplicative (and Exponential) Proof Structures is NL-Complete
• Minimality of the correctness criterion for multiplicative proof nets
• A new correctness criterion for the proof nets of non-commutative multiplicative linear logics
• A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic

Cited in

(1)

• Homology of proof-nets

This page was built for publication:

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