65 search results - page 3 / 13 » Preservation theorems for bounded formulas |
80
Voted
JSYML
2006
14 years 10 months ago
2006
We define a notion of realizability, based on a new assignment of formulas, which does not care for precise witnesses of existential statements, but only for bounds for them. The ...
68
Voted
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthemā...
87
Voted
DLT
2009
14 years 8 months ago
2009
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
83
Voted
COCO
2004
Springer
15 years 3 months ago
2004
Springer
We prove a parameterized analog of Schaeferās Dichotomy Theorem: we show that for every ļ¬nite boolean constraint family F, deciding whether a formula containing constraints fr...
98
Voted
ATVA
2006
Springer
15 years 2 months ago
2006
Springer
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...