Results 21 to 30 of about 1,933,548 (305)
REFLEXIVE-INSENSITIVE MODAL LOGICS [PDF]
The Review of Symbolic Logic, 2015 We analyze a class of modal logics rendered insensitive to reflexivity by way of a modification to the semantic definition of the modal operator. We explore the extent to which these logics can be characterized, and prove a general completeness theorem ...
David R. Gilbert, G. Venturi
semanticscholar +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 +3 more sources
Lindstrom theorems for fragments of first-order logic [PDF]
Logical Methods in Computer Science, 2009 Lindstr\"om theorems characterize logics in terms of model-theoretic conditions such as Compactness and the L\"owenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic.
Johan van Benthem +2 more
doaj +1 more source
Satisfiability vs. Finite Satisfiability in Elementary Modal Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our attention to finite ...
Jakub Michaliszyn +2 more
doaj +1 more source
The Logic of Khārijī Propositions [PDF]
حکمت سینوی, 2023 There are two general methods for interpreting and analyzing khārijī and ḥaqīqī propositions: first, by analyzing them within a unified logic; second, by assigning separate logics to khārijī and ḥaqīqī propositions.
Asadollah Fallahi
doaj +1 more source
Classical and Fuzzy Two-Layered Modal Logics for Uncertainty: Translations and Proof-Theory
International Journal of Computational Intelligence Systems, 2020 This paper is a contribution to the study of two distinct kinds of logics for modelling uncertainty. Both approaches use logics with a two-layered modal syntax, but while one employs classical logic on both levels and infinitely-many multimodal operators,
Paolo Baldi +2 more
doaj +1 more source
Density of truth in modal logics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 The aim of this paper is counting the probability that a random modal formula is a tautology. We examine $\{ \to,\Box \}$ fragment of two modal logics $\mathbf{S5}$ and $\mathbf{S4}$ over the language with one propositional variable.
Zofia Kostrzycka
doaj +1 more source
SYMMETRIES IN MODAL LOGICS [PDF]
The Bulletin of Symbolic Logic, 2015 AbstractIn this paper we develop the theoretical foundations to exploit symmetries in modal logics. We generalize the notion of symmetries of propositional formulas in conjunctive normal form to modal formulas using the framework provided by coinductive modal models introduced in [5].
Carlos Areces, Ezequiel Orbe
openaire +1 more source
Complexity results for modal logic with recursion via translations and tableaux [PDF]
Logical Methods in Computer ScienceThis paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics via translations
Luca Aceto +4 more
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