3 citations · 6 across the 4 of their papers we have counts for
5 papers
Forcing, Transition Algebras, and Calculi
Hashimoto Go, Daniel Găină, Ionuţ Ţuţu
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositi…
A modular bisimulation characterisation for fragments of hybrid logic
Guillermo Badia, Daniel Gaina, Alex Knapp +2
There are known characterisations of several fragments of hybrid logic by means of invariance under bisimulations of some kind. The fragments include $\{\store, \jump\}$ with or wi…
Robinson consistency in many-sorted hybrid first-order logics
Daniel Gaina, Guillermo Badia, Tomasz Kowalski
In this paper we prove a Robinson consistency theorem for a class of many-sorted hybrid logics as a consequence of an Omitting Types Theorem. An important corollary of this result…
Omitting Types Theorem in hybrid-dynamic first-order logic with rigid symbols
Daniel Gaina, Guillermo Badia, Tomasz Kowalski
In the the present contribution, we prove an Omitting Types Theorem (OTT) for an arbitrary fragment of hybriddynamic first-order logic with rigid symbols (i.e. symbols with fixed i…
Horn Clauses in Hybrid-Dynamic First-Order Logic
Daniel Găină, Ionuţ Ţuţu
We propose a hybrid-dynamic first-order logic as a formal foundation for specifying and reasoning about reconfigurable systems. As the name suggests, the formalism we develop exten…