3047 search results - page 25 / 610 » On the Meaning of Logical Completeness |
LICS
1994
IEEE
14 years 17 days ago
1994
IEEE
I give a `totality space' model for linear logic [4], detaking an abstract view of computations on a datatype. The model has similarities with both the coherence space model ...
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...
PLILP
1995
Springer
13 years 12 months ago
1995
Springer
Abstract. Using higher-order functions is standard practice in functional programming, but most functional logic programming languages that have been described in the literature la...
IGPL
2010
13 years 7 months ago
2010
The main contribution of this paper is a (strong) completeness result for an axiomatization of Hansson [13]’s deontic system DSDL2, whose semantics involves a non-necessarily tr...
JAPLL
2010
13 years 6 months ago
2010
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...