69 research outputs found
Expressivity and correspondence theory of many-valued hybrid logic
Abstract: The aim of this dissertation is to identify the construction of models that preserve (in both directions) the truth of hybrid formulas and therefore serve to characterize the expressivity of many-valued hybrid logic based on the framework of Hansen, Bolander and Brauner. We show that generated submodels and bounded morphisms preserve the truth of hybrid formulas in both directions. We also show that bisimilarity implies hybrid equivalence in general, however, the converse is not true in general. The converse is true for a weaker notion of a bisimulation for a special set of models, the image-finite models. The second significant contribution of this project is to develop the correspondence theory for many-valued hybrid logic. We show that the algorithm ALBA(first developed by Conradie and Palmigiano) can be extended to the many-valued hybrid setting. We call this extension MV-Hybrid ALBA. As a result, we successfully identify a syntactically defined class of hybrid formulas for a many-valued hybrid language, namely inductive formulas, whose members always have a local first-order frame correspondents. This inductive class generalizes the Sahlqvist class. An appropriate duality is obtained between frames in the chosen many-valued hybrid framework and a class of algebras having certain properties in order to extend ALBA to the many-valued hybrid setting.M.Sc. (Applied Mathematics
Bisimulations for Kripke models of Fuzzy Multimodal Logics
The main objective of the dissertation is to provide a detailed study of several different types of simulations and
bisimulations for Kripke models of fuzzy multimodal logics. Two types of simulations (forward and backward)
and five types of bisimulations (forward, backward, forward-backward, backward-forward and regular) are presented
hereby. For each type of simulation and bisimulation, an algorithm is created to test the existence of the simulation
or bisimulation and, if it exists, the algorithm computes the greatest one. The dissertation presents the application of
bisimulations in the state reduction of fuzzy Kripke models, while preserving their semantic properties. Next, weak simulations and bisimulations were considered and the Hennessy-Milner property was examined. Finally, an algorithm was created to compute weak simulations and bisimulations for fuzzy Kripke models over locally finite algebras
Characteristic Logics for Behavioural Hemimetrics via Fuzzy Lax Extensions
In systems involving quantitative data, such as probabilistic, fuzzy, or
metric systems, behavioural distances provide a more fine-grained comparison of
states than two-valued notions of behavioural equivalence or behaviour
inclusion. Like in the two-valued case, the wide variation found in system
types creates a need for generic methods that apply to many system types at
once. Approaches of this kind are emerging within the paradigm of universal
coalgebra, based either on lifting pseudometrics along set functors or on
lifting general real-valued (fuzzy) relations along functors by means of fuzzy
lax extensions. An immediate benefit of the latter is that they allow bounding
behavioural distance by means of fuzzy (bi-)simulations that need not
themselves be hemi- or pseudometrics; this is analogous to classical
simulations and bisimulations, which need not be preorders or equivalence
relations, respectively. The known generic pseudometric liftings, specifically
the generic Kantorovich and Wasserstein liftings, both can be extended to yield
fuzzy lax extensions, using the fact that both are effectively given by a
choice of quantitative modalities. Our central result then shows that in fact
all fuzzy lax extensions are Kantorovich extensions for a suitable set of
quantitative modalities, the so-called Moss modalities. For nonexpansive fuzzy
lax extensions, this allows for the extraction of quantitative modal logics
that characterize behavioural distance, i.e. satisfy a quantitative version of
the Hennessy-Milner theorem; equivalently, we obtain expressiveness of a
quantitative version of Moss' coalgebraic logic. All our results explicitly
hold also for asymmetric distances (hemimetrics), i.e. notions of quantitative
simulation
Many-Valued Hybrid Logic
In this paper we define a family of many-valued semantics for hybrid logic, where each semantics is based on a finite Heyting algebra of truth-values. We provide sound and complete tableau systems for these semantics. Moreover, we show how the tableau systems can be made terminating and thereby give rise to decision procedures for the logics in question. Our many-valued hybrid logics turn out to be "intermediate" logics between intuitionistic hybrid logic and classical hybrid logic in a specific sense explained in the paper. Our results show that many-valued hybrid logic is indeed a natural enterprise
Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions
Behavioural distances provide a fine-grained measure of equivalence in systems involving quantitative data, such as probabilistic, fuzzy, or metric systems. Like in the classical setting of crisp bisimulation-type equivalences, the wide variation found in system types creates a need for generic methods that apply to many system types at once. Approaches of this kind are emerging within the paradigm of universal coalgebra, based either on lifting pseudometrics along set functors or on lifting general real-valued (fuzzy) relations along functors by means of fuzzy lax extensions. An immediate benefit of the latter is that they allow bounding behavioural distance by means of fuzzy bisimulations that need not themselves be (pseudo-)metrics, in analogy to classical bisimulations (which need not be equivalence relations). The known instances of generic pseudometric liftings, specifically the generic Kantorovich and Wasserstein liftings, both can be extended to yield fuzzy lax extensions, using the fact that both are effectively given by a choice of quantitative modalities. Our central result then shows that in fact all fuzzy lax extensions are Kantorovich extensions for a suitable set of quantitative modalities, the so-called Moss modalities. For non-expansive fuzzy lax extensions, this allows for the extraction of quantitative modal logics that characterize behavioural distance, i.e. satisfy a quantitative version of the Hennessy-Milner theorem; equivalently, we obtain expressiveness of a quantitative version of Moss\u27 coalgebraic logic
- …