Correctness of Multiplicative Additive Proof Structures is NL-Complete

We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NLcomplete.

• Type: Conference
• Year: 2008
• Where: LICS
• Authors: Paulin Jacobé de Naurois, Virgile Mogbil
• Keywords: Computer Science, Correctness Criterion, LICS 2008, Multiplicative Additive Fragment