Results 31 to 40 of about 1,731,030 (337)
A basic epistemic logic and its algebraic model
Intermaths, 2023 In this paper we propose an algebraic model for a modal epistemic logic. Although it is known the existence of algebraic models for modal logics, considering that there are so many different modal logics, so it is not usual to give an algebraic model ...
Hércules de Araujo Feitosa +2 more
doaj +3 more sources
MoSeL: a general, extensible modal framework for interactive proofs in separation logic
Proc. ACM Program. Lang., 2018 A number of tools have been developed for carrying out separation-logic proofs mechanically using an interactive proof assistant. One of the most advanced such tools is the Iris Proof Mode (IPM) for Coq, which offers a rich set of tactics for making ...
Robbert Krebbers +7 more
semanticscholar +1 more source
Combination of temporal logic with modal logic KD
Lietuvos Matematikos Rinkinys, 2003 There is not abstract.
Regimantas Pliuškevičius
doaj +3 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 +1 more source
Semantical Considerations on Modal Logic
Problemos, 2023 Iš anglų kalbos vertė ir pratarmę parašė Pranciškus Gricius, Vilniaus ...
Saul A. Kripke
doaj +1 more source
Uniform interpolation and sequent calculi in modal logic
Archive for Mathematical Logic, 2015 A method is presented that connects the existence of uniform interpolants to the existence of certain sequent calculi. This method is applied to several modal logics and is shown to cover known results from the literature, such as the existence of ...
Rosalie Iemhoff
semanticscholar +1 more source
Weak models of distributed computing, with connections to modal logic [PDF]
Distributed computing, 2012 This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and study models of computing that are weaker versions of the widely-studied port-numbering model. In the port-numbering model,
L. Hella +7 more
semanticscholar +1 more source
Bulletin of the Section of LogicA 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 +1 more source
Organon F, 2019 100 years ago C.I. Lewis published A Survey of Symbolic Logic, which included an axiom system for a notion of implication which was ‘stricter’ than that found in Whitehead and Russell’s Principia Mathematica.
Max Cresswell
doaj +1 more source
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