Sciweavers

Share
LICS
2008
IEEE

Correctness of Multiplicative Additive Proof Structures is NL-Complete

9 years 1 months ago
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.
Paulin Jacobé de Naurois, Virgile Mogbil
Added 31 May 2010
Updated 31 May 2010
Type Conference
Year 2008
Where LICS
Authors Paulin Jacobé de Naurois, Virgile Mogbil
Comments (0)
books