15 search results - page 1 / 3 » On the Forcing Semantics for Monoidal t-norm Based Logic |
JUCS
2007
13 years 4 months ago
2007
CSR
2008
Springer
13 years 6 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...
TCS
2011
12 years 11 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
ICFP
2006
ACM
14 years 4 months ago
2006
ACM
We present a unifying solution to the problem of fusion of functions, where both the producer function and the consumer function have one accumulating parameter. The key idea in t...
EUSFLAT
2007
13 years 6 months ago
2007
Fuzzy formal logics were introduced in order to handle graded truth values instead of only ‘true’ and ‘false’. A wide range of such logics were introduced successfully, li...