Ehrenfeucht-Fraisse games provide means to characterize elementary equivalence for first-order logic, and by standard translation also for modal logics. We propose a novel generalization of Ehrenfeucht- Fraisse games to hybrid-dynamic logics which is direct and fully modular: parameterized by the features of the hybrid language we wish to include, for instance, the modal and hybrid language operators as well as first-order existential quantification. We use these games to establish a new modular Fraisse-Hintikka Theorem for hybrid-dynamic propositional logic and its various fragments. We study the relationship between countable game equivalence (determined by countable Ehrenfeucht- Fraisse games) and bisimulation (determined by countable back-and-forth systems). In general, the former turns out to be weaker than the latter, but under certain conditions on the language, the two coincide. We also use games to prove that for reachable image-finite Kripke structures elementary equivalence implies isomorphism.

翻译：Ehrenfeucht-Fraïssé 博弈为刻画一阶逻辑的基本等价性提供了方法，通过标准翻译也适用于模态逻辑。我们提出了一种将 Ehrenfeucht-Fraïssé 博弈推广到混合动态逻辑的新方法，该方法直接且完全模块化：其参数化取决于我们希望包含的混合语言特征，例如模态与混合语言算子以及一阶存在量化。我们利用这些博弈为混合动态命题逻辑及其各种片段建立了一个新的模块化 Fraïssé-Hintikka 定理。我们研究了可数博弈等价性（由可数 Ehrenfeucht-Fraïssé 博弈决定）与互模拟（由可数来回系统决定）之间的关系。一般而言，前者弱于后者，但在语言的某些条件下，两者是一致的。我们还利用博弈证明了对于可达的像有限 Kripke 结构，基本等价性蕴含同构性。