Paper Info
Title
Correctness of linear logic proof structures is NL-complete
Abstract
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.
Year
DOI
Venue
2011
10.1016/j.tcs.2010.12.020
Theor. Comput. Sci.
Keywords
DocType
Volume
new correctness criterion,Correctness criteria,linear logic proof structure,Nondeterministic logspace,linear logic,Linear logic,Complexity classes
Journal
412
Issue
ISSN
Citations 
20
Theoretical Computer Science
6
PageRank 
References 
Authors
0.57
11
2
Name
Order
Citations
PageRank
Paulin Jacobé de Naurois1344.98
Virgile Mogbil2696.77