Sciweavers

1391 search results - page 7 / 279
» Completeness of Neighbourhood Logic
Sort
View
ASPDAC
2008
ACM
160views Hardware» more  ASPDAC 2008»
13 years 9 months ago
Reconfigurable RTD-based circuit elements of complete logic functionality
Abstract--Resonant tunneling diodes (RTDs) have demonstrated promising circuit characteristics of high speed switching property and versatile functionality with negative differenti...
Yexin Zheng, Chao Huang
JSYML
2008
74views more  JSYML 2008»
13 years 7 months ago
Omitting types for finite variable fragments and complete representations of algebras
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
Tarek Sayed Ahmed, Hajnal Andréka, Istv&aac...
TIME
2007
IEEE
14 years 2 months ago
A Symbolic Decision Procedure for Robust Safety of Timed Systems
We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t. infinitesimal clock-drif...
Mani Swaminathan, Martin Fränzle
STACS
2009
Springer
14 years 2 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson
SOCO
2008
Springer
13 years 7 months ago
Strong non-standard completeness for fuzzy logics
In this paper we are going to introduce the notion of strong non-standard completeness (SNSC) for fuzzy logics. This notion naturally arises from the well known construction by ul...
Tommaso Flaminio