Sciweavers

Share
TCS
2011

Correctness of linear logic proof structures is NL-complete

8 years 1 months ago
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.
Paulin Jacobé de Naurois, Virgile Mogbil
Added 15 May 2011
Updated 15 May 2011
Type Journal
Year 2011
Where TCS
Authors Paulin Jacobé de Naurois, Virgile Mogbil
Comments (0)
books