English
Related papers

Related papers: An algebraic generalization of Kripke structures

200 papers

In [Hitzler and Wendt 2002, 2005], a new methodology has been proposed which allows to derive uniform characterizations of different declarative semantics for logic programs with negation. One result from this work is that the well-founded…

Artificial Intelligence · Computer Science 2007-05-23 Pascal Hitzler

Modal logics allow reasoning about various modes of truth: for example, what it means for something to be possibly true, or to know that something is true as opposed to merely believing it. This report describes embeddings of propositional…

Logic in Computer Science · Computer Science 2022-05-16 John Rushby

Generalized topological spaces are not necessarily closed under finite intersections. Moreover, the whole universe does not need to be open. We use modified version of this framework to establish certain models for non-normal modal logics.…

Logic · Mathematics 2020-05-28 Tomasz Witczak

A normal modal logic is pretransitive, if the modality corresponding to the transitive closure of an accessibility relation is expressible in it. In the present work we establish the finite model property for pretransitive generalizations…

Logic · Mathematics 2025-12-16 Lev Dvorkin

We rely on the strength of linguistic and philosophical perspectives in constructing a framework that offers a unified explanation for presuppositions and existential commitment. We use a rich ontology and a set of methodological principles…

cmp-lg · Computer Science 2008-02-03 Daniel Marcu , Graeme Hirst

Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor on some full subcategory of the…

Logic · Mathematics 2023-06-22 Nick Bezhanishvili , Jim de Groot , Yde Venema

We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and it may be strong or classical. Proofs of strong propositions must be…

Logic in Computer Science · Computer Science 2021-04-19 Pablo Barenbaum , Teodoro Freund

This article initiates the semantic study of distribution-free normal modal logic systems, laying the semantic foundations and anticipating further research in the area. The article explores roughly the same area, though taking a different…

Logic in Computer Science · Computer Science 2025-11-25 Chrysafis Hartonas

Quantum logic aims to capture essential quantum mechanical structure in order-theoretic terms. The Achilles' heel of quantum logic is the absence of a canonical description of composite systems, given descriptions of their components. We…

Quantum Physics · Physics 2013-05-10 Bob Coecke , Chris Heunen , Aleks Kissinger

We define Quillen model structures on a family of presheaf toposes arising from tree unravellings of Kripke models, leading to a homotopy theory for modal logic. Modal preservation theorems and the Hennessy-Milner property are revisited…

Logic · Mathematics 2023-10-19 Luca Reggio

We introduce the first order logic of proofs $FOLP^\Box$ in the joint language combining justification terms and binding modalities. The main issue is Kripke--style semantics for this logic. We describe models for $FOLP^\Box$ in terms of…

Logic in Computer Science · Computer Science 2025-12-10 Tatiana Yavorskaya , Elena Popova

The framework of quantitative equational logic has been successfully applied to reason about algebras whose carriers are metric spaces and operations are nonexpansive. We extend this framework in two orthogonal directions: algebras endowed…

Logic in Computer Science · Computer Science 2022-01-25 Matteo Mio , Ralph Sarkis , Valeria Vignudelli

In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic and classical logics. We prove a completeness theorem for this logic with respect to a Kripke semantics. We establish…

Logic · Mathematics 2009-05-05 Karim Nour , Abir Nour

We study what we call topological cylindric algebras and tense cylindric algebras defined for every ordinal $\alpha$. The former are cylindric algebras of dimension $\alpha$ expanded with $\sf S4$ modalities indexed by $\alpha$. The…

Logic · Mathematics 2014-02-26 Tarek Sayed Ahmed

In a modular approach, we lift Hilbert-style proof systems for propositional, modal and first-order logic to generalized systems for their respective team-based extensions. We obtain sound and complete axiomatizations for the…

Logic in Computer Science · Computer Science 2018-03-28 Martin Lück

We introduce FIK, a natural intuitionistic modal logic specified by Kripke models satisfying the condition of forward confluence. We give a complete Hilbert-style axiomatization of this logic and propose a bi-nested calculus for it. The…

Logic in Computer Science · Computer Science 2023-09-13 Philippe Balbiani , Han Gao , Çiğdem Gencer , Nicola Olivetti

Non-normal modal logics, interpreted on neighbourhood models which generalise the usual relational semantics, have found application in several areas, such as epistemic, deontic, and coalitional reasoning. We present here preliminary…

Logic in Computer Science · Computer Science 2022-07-04 Tiziano Dalmonte , Andrea Mazzullo , Ana Ozaki

We use modal logic as a framework for coalgebraic trace semantics, and show the flexibility of the approach with concrete examples such as the language semantics of weighted, alternating and tree automata, and the trace semantics of…

Logic in Computer Science · Computer Science 2019-03-14 Bartek Klin , Jurriaan Rot

We study extensions of standard description logics to the framework of polyadic modal logic. We promote a natural approach to such logics via general relation algebras that can be used to define operations on relations of all arities. As a…

Logic in Computer Science · Computer Science 2021-08-20 Jonne Iso-Tuisku , Antti Kuusisto

We present natural deduction systems and associated modal lambda calculi for the necessity fragments of the normal modal logics K, T, K4, GL and S4. These systems are in the dual-context style: they feature two distinct zones of…

Logic in Computer Science · Computer Science 2023-06-22 G. A. Kavvos