Results 1 to 10 of about 153,381 (281)
Complexity of validity for propositional dependence logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We study the validity problem for propositional dependence logic, modal dependence logic and extended modal dependence logic. We show that the validity problem for propositional dependence logic is NEXPTIME-complete.
Jonni Virtema
doaj +4 more sources
The expressive power of modal logic with inclusion atoms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete characterisation for the
Lauri Hella, Johanna Stumpf
doaj +4 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 +3 more sources
Systematic Verification of the Modal Logic Cube in Isabelle/HOL [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We present an automated verification of the well-known modal logic cube in Isabelle/HOL, in which we prove the inclusion relations between the cube's logics using automated reasoning tools. Prior work addresses this problem but without restriction to the
Christoph Benzmüller +2 more
doaj +6 more sources
Towards a Proof Theory of G\"odel Modal Logics [PDF]
Logical Methods in Computer Science, 2011 Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of G\"odel logic.
George Metcalfe, Nicola Olivetti
doaj +3 more sources
Information and Computation, 2013 In this paper we present {\em refinement modal logic}. A refinement is like a bisimulation, except that from the three relational requirements only `atoms' and `back' need to be satisfied.
Aczel +65 more
core +6 more sources
, 2020 The discussion about how to put together Gentzen's systems for classical and intuitionistic logic in a single unified system is back in fashion. Indeed, recently Prawitz and others have been discussing the so called Ecumenical Systems, where connectives ...
A Ciabattoni +8 more
core +2 more sources
Modal meet-implication logic [PDF]
Logical Methods in Computer Science, 2022 We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame.
Jim de Groot, Dirk Pattinson
doaj +1 more source
Logic-Sensitivity of Aristotelian Diagrams in Non-Normal Modal Logics
Axioms, 2021 Aristotelian diagrams, such as the square of opposition, are well-known in the context of normal modal logics (i.e., systems of modal logic which can be given a relational semantics in terms of Kripke models). This paper studies Aristotelian diagrams for
Lorenz Demey
doaj +1 more source
Graded Many-Valued Modal Logic and Its Graded Rough Truth
Axioms, 2022 Much attention is focused on the relationship between rough sets and many-valued modal logic to deal with approximate reasoning. This paper discusses the graded modal logic and puts forward the graded many-valued modal logic G(S5). Secondly, by employing
Jiansheng Li, Zengtai Gong
doaj +1 more source