Forcing and calculi for hybrid logics

D Găină - Journal of the ACM (JACM), 2020 - dl.acm.org
The definition of institution formalizes the intuitive notion of logic in a category-based setting.
Similarly, the concept of stratified institution provides an abstract approach to Kripke …

Omitting types theorem in hybrid dynamic first-order logic with rigid symbols

D Găină, G Badia, T Kowalski - Annals of Pure and Applied Logic, 2023 - Elsevier
In the present contribution, we prove an Omitting Types Theorem (OTT) for an arbitrary
fragment of hybrid dynamic first-order logic with rigid symbols (ie symbols with fixed …

Birkhoff style calculi for hybrid logics

D Găină - Formal Aspects of Computing, 2017 - Springer
We develop an abstract proof calculus for hybrid logics whose sentences are (hybrid) Horn
clauses, and we prove a Birkhoff completeness theorem for hybrid logics in the general …

Robinson consistency in many-sorted hybrid first-order logics

D Gaina, G Badia, T Kowalski - arxiv preprint arxiv:2208.08708, 2022 - arxiv.org
arxiv:2208.08708v1 [math.LO] 18 Aug 2022 Page 1 arxiv:2208.08708v1 [math.LO] 18 Aug
2022 Robinson consistency in many-sorted hybrid first-order logics Daniel Gaina1 Kyushu …

Birkhoff completeness for hybrid-dynamic first-order logic

D Găină, I Ţuţu - Automated Reasoning with Analytic Tableaux and …, 2019 - Springer
Hybrid-dynamic first-order logic is a kind of modal logic obtained by enriching many-sorted
first-order logic with features that are common to hybrid and to dynamic logics. This provides …

Birkhoff style proof systems for hybrid-dynamic quantum logic

D Gaina - arxiv preprint arxiv:2406.13360, 2024 - arxiv.org
We explore a simple approach to quantum logic based on hybrid and dynamic modal logic,
where the set of states is given by some Hilbert space. In this setting, a notion of quantum …

Logics for Actor Networks: A two-stage constrained-hybridisation approach

JL Fiadeiro, I Ţuţu, A Lopes, D Pavlovic - Journal of Logical and Algebraic …, 2019 - Elsevier
Actor Networks are a modelling framework for cyber-physical-system protocols based on
Latour's actor-network theory that addresses the way we now create and exploit the power of …

[HTML][HTML] Stability of termination and sufficient-completeness under pushouts via amalgamation

D Găină, M Nakamura, K Ogata, K Futatsugi - Theoretical Computer …, 2020 - Elsevier
In the present study, we provide conditions for the existence of pushouts of signature
morphisms in constructor-based order-sorted algebra, and then we prove that reducibility …

Many-sorted hybrid modal languages

I Leuştean, N Moangă, TF Şerbănuţă - … of Logical and Algebraic Methods in …, 2021 - Elsevier
We continue our investigation into using the hybridization technique on top of the many-
sorted polyadic modal logic we have previously defined. By adding different operators and …

Lindström's theorem, both syntax and semantics free

D Găină, T Kowalski - Journal of Logic and Computation, 2022 - academic.oup.com
Lindström's theorem characterizes first-order logic in terms of its essential model theoretic
properties. One cannot gain expressive power extending first-order logic without losing at …