107 search results - page 2 / 22 » Correctness of linear logic proof structures is NL-complete |
TCS
2010
13 years 3 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
MSCS
2007
13 years 4 months ago
2007
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less ...
ENTCS
2011
12 years 11 months ago
2011
In the past years, linear logic has been successfully used as a general logical framework for encoding proof systems. Due to linear logic’s finer control on structural rules, i...
CSL
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
ICLP
2010
Springer
13 years 8 months ago
2010
Springer
The proof-theoretic approach to logic programming has benefited from the