345 search results - page 26 / 69 » Kripke models for classical logic |
BIRTHDAY
2000
Springer
14 years 22 hour ago
2000
Springer
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an orderextensional setting. The partial order of caus...
HIM
1997
Springer
13 years 12 months ago
1997
Springer
Classical retrieval models support content-oriented searching for documents using a set of words as data model. However, in hypertext and database applications we want to consider...
KI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Rule-based programming paradigm is omnipresent in number of engineering domains. However, there are some fundamental semantical differences between it, and classic progr...
ICDE
1992
IEEE
13 years 11 months ago
1992
IEEE
Contrary to popular belief, relation schemes in good classical normal forms are not necessarily devoid of redundancies. This arises from the fact that classical data dependencies ...
STTT
2010
13 years 2 months ago
2010
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...