9 research outputs found
A (Co)algebraic Approach to Hennessy-Milner Theorems for Weakly Expressive Logics
Coalgebraic modal logic, as in [9, 6], is a framework in which modal logics for specifying coalgebras can be developed parametric in the signature of the modal language and the coalgebra type functor T. Given a base logic (usually classical propositional logic), modalities are interpreted via so-called predicate liftings for the functor T. These are natural transformations that turn a predicate over the state space X into a predicate over TX. Given that T-coalgebras come with general notions of T-bisimilarity [11] and behavioral equivalence [7], coalgebraic modal logics are designed to respect those. In particular, if two states are behaviourally equivalent then they satisfy the same formulas. If the converse holds, then the logic is said to be expressive. and we have a generalisation of the classic Hennessy-Milner theorem [5] which states that over the class of image-fjnite Kripke models, two states are Kripke bisimilar if and only if they satisfy the same formulas in Hennessy-Milner logic
A Note on the Completeness of Many-Valued Coalgebraic Modal Logic
In this paper, we investigate the many-valued version of coalgebraic modal
logic through predicate lifting approach. Coalgebras, understood as generic
transition systems, can serve as semantic structures for various kinds of modal
logics. A well-known result in coalgebraic modal logic is that its completeness
can be determined at the one-step level. We generalize the result to the
finitely many-valued case by using the canonical model construction method. We
prove the result for coalgebraic modal logics based on three different
many-valued algebraic structures, including the finitely-valued {\L}ukasiewicz
algebra, the commutative integral Full-Lambek algebra (FL-algebra)
expanded with canonical constants and Baaz Delta, and the FL-algebra
expanded with valuation operations.Comment: 17 pages, preprint for journal submissio
Many-Valued Coalgebraic Logic: From Boolean Algebras to Primal Varieties
We study many-valued coalgebraic logics with primal algebras of truth-degrees. We describe a way to lift algebraic semantics of classical coalgebraic logics, given by an endofunctor on the variety of Boolean algebras, to this many-valued setting, and we show that many important properties of the original logic are inherited by its lifting. Then, we deal with the problem of obtaining a concrete axiomatic presentation of the variety of algebras for this lifted logic, given that we know one for the original one. We solve this problem for a class of presentations which behaves well with respect to a lattice structure on the algebra of truth-degrees
Bisimulation for Weakly Expressive Coalgebraic Modal Logics
Research on the expressiveness of coalgebraic modal logics with respect to semantic equivalence notions has so far focused mainly on finding logics that are able to distinguish states that are not behaviourally equivalent (such logics are said to be expressive). In other words, the notion of behavioural equivalence is taken as the starting point, and the expressiveness of the logic is evaluated against it.
However, for some applications, modal logics that are not expressive are of independent interest. Such an example is given by contingency logic.
We can now turn the question of expressiveness around and ask, given a modal logic, what is a suitable notion of semantic equivalence? In this paper, we propose a notion of Lambda-bisimulation which is parametric in a collection
Lambda of predicate liftings. We study the basic properties of Lambda-bisimilarity, and prove as our main result a Hennessy-Milner style theorem, which shows that (for finitary functors) Lambda-bisimilarity exactly matches the expressiveness of the coalgebraic modal logic arising from Lambda
A Lindström theorem in many-valued modal logic over a finite MTL-chain
We consider a modal language over crisp frames and formulas evaluated on a finite MTL-chain (a linearly ordered commutative integral residuated lattice). We first show that the basic modal abstract logic with constants for the values of the MTL-chain is the maximal abstract logic satisfying Compactness, the Tarski Union Property and strong invariance for bisimulations. Finally, we improve this result by replacing the Tarski Union Property by a relativization property. © 2019 Elsevier B.V.We are grateful to two anonymous referees and the editor of this journal for their numerous and helpful comments. Their help greatly improved the paper. Guillermo Badia is supported by the project I 1923-N25 of the Austrian Science Fund (FWF). Grigory Olkhovikov is supported by Deutsche Forschungsgemeinschaft (DFG), project WA 936/11-1
A Lindström Theorem in Many-Valued Modal Logic over a Finite MTL-chain
We consider a modal language over crisp frames and formulas evaluated on a finite MTL-chain (a linearly ordered commutative integral residuated lattice). We first show that the basic modal abstract logic with constants for the values of the MTL-chain is the maximal abstract logic satisfying Compactness, the Tarski Union Property and strong invariance for bisimulations. Finally, we improve this result by replacing the Tarski Union Property by a relativization property
Many-valued coalgebraic logic over semi-primal varieties
We study many-valued coalgebraic logics with semi-primal algebras of
truth-degrees. We provide a systematic way to lift endofunctors defined on the
variety of Boolean algebras to endofunctors on the variety generated by a
semi-primal algebra. We show that this can be extended to a technique to lift
classical coalgebraic logics to many-valued ones, and that (one-step)
completeness and expressivity are preserved under this lifting. For specific
classes of endofunctors, we also describe how to obtain an axiomatization of
the lifted many-valued logic directly from an axiomatization of the original
classical one. In particular, we apply all of these techniques to classical
modal logic
Expressive Logics for Coinductive Predicates
The classical Hennessy-Milner theorem says that two states of an image-finite
transition system are bisimilar if and only if they satisfy the same formulas
in a certain modal logic. In this paper we study this type of result in a
general context, moving from transition systems to coalgebras and from
bisimilarity to coinductive predicates. We formulate when a logic fully
characterises a coinductive predicate on coalgebras, by providing suitable
notions of adequacy and expressivity, and give sufficient conditions on the
semantics. The approach is illustrated with logics characterising similarity,
divergence and a behavioural metric on automata
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