Sciweavers

3047 search results - page 37 / 610
» On the Meaning of Logical Completeness
Sort
View
CTCS
1989
Springer
14 years 16 days ago
Quantitative Domains, Groupoids and Linear Logic
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...
Paul Taylor 0002
JOLLI
2002
141views more  JOLLI 2002»
13 years 8 months ago
Naming Worlds in Modal and Temporal Logic
In this paper we suggest adding to predicate modal and temporal logic a locality predicate W which gives names to worlds (or time points). We also study an equal time predicate D(x...
Dov M. Gabbay, G. Malod
DDECS
2009
IEEE
202views Hardware» more  DDECS 2009»
14 years 3 months ago
Asynchronous two-level logic of reduced cost
— We propose a novel synthesis method of a dual-rail asynchronous two-level logic of reduced cost. It is based on a model that operates under so called modified weak constraints....
Igor Lemberski, Petr Fiser
LOGCOM
2006
90views more  LOGCOM 2006»
13 years 8 months ago
Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators
For every Kripke complete modal logic L we define its hybrid companion LH . For a reasonable class of logics, we present a satisfiability-preserving translation from LH to L. We p...
Nick Bezhanishvili, Balder ten Cate
ALP
1994
Springer
14 years 17 days ago
A Logic for Variable Aliasing in Logic Programs
This paper introduces a logic for a class of properties - in particular variable aliasing - used in static analysis of logic programs. The logic is shown to be sound, complete and ...
Elena Marchiori