1391 search results - page 63 / 279 » Completeness of Neighbourhood Logic |
JSYML
2008
13 years 9 months ago
2008
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is introduced that can be considered as an alternative to Skolemization in the setting ...
TCS
1998
13 years 8 months ago
1998
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA...
ICLA
2011
Springer
13 years 16 days ago
2011
Springer
We examine a logic that combines knowledge, awareness, and change of awareness. Change of awareness involves that an agent becomes aware of propositional variables. We show that th...
TABLEAUX
2009
Springer
14 years 3 months ago
2009
Springer
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then...
FOSSACS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities ...