54 search results - page 5 / 11 » On Proof Nets for Multiplicative Linear Logic with Units |
CSR
2008
Springer
14 years 11 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
14 years 10 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
14 years 11 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 ...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
LICS
2008
IEEE
15 years 4 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...