Results 11 to 20 of about 1,933,548 (305)
Intuitionistic Non-normal Modal Logics: A General Framework [PDF]
Journal of Philosophical Logic, 2019 We define a family of intuitionistic non-normal modal logics; they can be seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only Necessity or Possibility.
Tiziano Dalmonte +2 more
semanticscholar +1 more source
Modal Logics of Topological Relations [PDF]
Logical Methods in Computer Science, 2006 Logical formalisms for reasoning about relations between spatial regions play a fundamental role in geographical information systems, spatial and constraint databases, and spatial reasoning in AI.
Carsten Lutz, Frank Wolter
doaj +1 more source
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 +2 more sources
Symmetries in Modal Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We generalize the notion of symmetries of propositional formulas in conjunctive normal form to modal formulas. Our framework uses the coinductive models and, hence, the results apply to a wide class of modal logics including, for example, hybrid logics ...
Carlos Areces +2 more
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
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 +4 more sources
Graphical Sequent Calculi for Modal Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 The syntax of modal graphs is defined in terms of the continuous cut and broken cut following Charles Peirce's notation in the gamma part of his graphical logic of existential graphs.
Minghui Ma, Ahti-Veikko Pietarinen
doaj +1 more source
Generic Modal Cut Elimination Applied to Conditional Logics [PDF]
Logical Methods in Computer Science, 2011 We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide
Dirk Pattinson, Lutz Schröder
doaj +1 more source
Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard? [PDF]
Logical Methods in Computer Science, 2022 Adding propositional quantification to the modal logics K, T or S4 is known to lead to undecidability but CTL with propositional quantification under the tree semantics (tQCTL) admits a non-elementary Tower-complete satisfiability problem. We investigate
Bartosz Bednarczyk, Stéphane Demri
doaj +1 more source
Bulletin of the Section of Logic, 2021 This paper introduces the logics of super-strict implications, where a super-strict implication is a strengthening of C.I. Lewis' strict implication that avoids not only the paradoxes of material implication but also those of strict implication.
Guido Gherardi, Eugenio Orlandelli
doaj +1 more source