Correctness of linear logic proof structures is NL-complete

Paulin Jacobé de Naurois, Virgile Mogbil. Correctness of linear logic proof structures is NL-complete. Theoretical Computer Science, 412(20):1941-1957, 2011. [doi]

Abstract

Abstract is missing.