47 search results - page 4 / 10 » Proof nets sequentialisation in multiplicative linear logic |
CSL
2010
Springer
13 years 8 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...
CADE
1997
Springer
13 years 11 months ago
1997
Springer
We present a matrix characterization of logical validity in the multiplicative fragment of linear logic. On this basis we develop a matrix-based proof search procedure for this fra...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We show that for Multiplicative Exponential Linear Logic (without weakenings) the syntactical equivalence relation on proofs induced by cut-elimination coincides with the semantic ...
COLING
2000
13 years 9 months ago
2000
Most of the studies in the framework of Lambek calculus have considered the parsing process and ignored the generation process. This paper wants to rely on the close link between ...