107 search results - page 1 / 22 » Correctness of linear logic proof structures is NL-complete |
CSL
2007
Springer
14 years 5 months ago
2007
Springer
We provide a new correctness criterion for unit-free MLL proof structures and MELL proof structures with units. We prove that deciding the correctness of a MLL and of a MELL proof ...
TCS
2011
13 years 5 months ago
2011
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...
CSL
2008
Springer
14 years 18 days ago
2008
Springer
We give a graph theoretical criterion on multiplicative additive linear logic (MALL) cut-free proof structures that exactly characterizes those whose interpretation is a hypercliqu...
LPAR
2007
Springer
14 years 5 months ago
2007
Springer
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
LICS
2008
IEEE
14 years 5 months ago
2008
IEEE
We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NLcomple...