Correctness of linear logic proof structures is NL-complete

We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a linear logic proof structure is NL-complete.

• Type: Journal
• Year: 2011
• Where: TCS
• Authors: Paulin Jacobé de Naurois, Virgile Mogbil
• Keywords: Correctness, Linear Logic, Linear Logic Proof, TCS 2011, Theoretical Computer Science