Results 11 to 20 of about 1,125,186 (250)
Modal Logics are Coalgebraic [PDF]
Electronic Workshops in Computing, 2008 Applications of modal logics are abundant in computer science, and a large number of structurally different modal logics have been successfully employed in a diverse spectrum of application contexts.
Yde Venema +14 more
core +11 more sources
Bulletin of the Section of LogicWe prove that the modal logic of lattices with the accessibility relation of being isomorphic to a sublattice is S4.2. The same is proven for modular and distributive lattices.
Maciej A. Hałapacz
doaj +2 more sources
A Real-Valued Modal Logic [PDF]
Logical Methods in Computer Science, 2018 A many-valued modal logic is introduced that combines the usual Kripke frame semantics of the modal logic K with connectives interpreted locally at worlds by lattice and group operations over the real numbers.
Denisa Diaconescu +2 more
doaj +4 more sources
Linear Abelian Modal Logic [PDF]
Bulletin of the Section of Logic, 2023 A many-valued modal logic, called linear abelian modal logic \(\rm {\mathbf{LK(A)}}\) is introduced as an extension of the abelian modal logic \(\rm \mathbf{K(A)}\). Abelian modal logic \(\rm \mathbf{K(A)}\) is the minimal modal extension of the logic of
Hamzeh Mohammadi
doaj +2 more sources
Binary modal logic and unary modal logic
Logic Journal of the IGPL, 2023 Abstract Standard unary modal logic and binary modal logic, i.e. modal logic with one binary operator, are shown to be definitional extensions of one another when an additional axiom $U$ is added to the basic axiomatization of the binary side. This is a strengthening of our previous results.
Dick de Jongh +1 more
openaire +3 more sources
Modal independence logic: [PDF]
Journal of Logic and Computation, 2016 This paper introduces modal independence logic MIL, a modal logic that can explicitly talk about independence among propositional variables. Formulas of MIL are not evaluated in worlds but in sets of worlds, so called teams. In this vein, MIL can be seen as a variant of Väänänen's modal dependence logic MDL.
Juha Kontinen +3 more
openaire +6 more sources
Bisimulation in Inquisitive Modal Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are ...
Ivano Ciardelli, Martin Otto
doaj +1 more source
A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic [PDF]
Logical Methods in Computer Science, 2021 Open bisimilarity is defined for open process terms in which free variables may appear. The insight is, in order to characterise open bisimilarity, we move to the setting of intuitionistic modal logics. The intuitionistic modal logic introduced, called $\
Ki Yung Ahn, Ross Horne, Alwen Tiu
doaj +1 more source
Positive Modal Logic Beyond Distributivity [PDF]
, 2023 We develop a duality for (modal) lattices that need not be distributive, and use it to study positive (modal) logic beyond distributivity, which we call weak positive (modal) logic. This duality builds on the Hofmann, Mislove and Stralka duality for meet-
Dmitrieva, Anna +4 more
core +1 more source
The Review of Symbolic Logic, 2018 AbstractStable logics are modal logics characterized by a class of frames closed under relation preserving images. These logics admit all filtrations. Since many basic modal systems such as K4 and S4 are not stable, we introduce the more general concept of an M-stable logic, where M is an arbitrary normal modal logic that admits some filtration.
Guram Bezhanishvili +2 more
openaire +4 more sources