244 search results - page 21 / 49 » A Way to Interpret Lukasiewicz Logic and Basic Logic |
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
ICFP
2010
ACM
13 years 7 months ago
2010
ACM
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
CTCS
1989
Springer
13 years 11 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
IFIP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Trust Management is an approach to construct and interpret the trust relationships among public-keys that are used to mediate security-critical actions. Cryptographic cre...
COCO
2008
Springer
13 years 9 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...