English
Related papers

Related papers: Symmetries in Modal Logics

200 papers

We establish a novel connection between two research areas in non-classical logics which have been developed independently of each other so far: on the one hand, input/output logic, introduced within a research program developing logical…

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 define a notion of Lambda-simulation for coalgebraic modal logics, parametric on the choice Lambda of predicate liftings for a functor T. We show this notion is adequate in several ways: i) it preserves truth of positive formulas, ii)…

Logic in Computer Science · Computer Science 2013-04-12 Daniel Gorín , Lutz Schröder

We prove expressive completeness results for convex propositional and modal team logics, where a logic is convex if, for each formula, if it is true in two teams $t$ and $u$ and $t\subseteq s\subseteq u$, then it is also true in $s$. We…

Logic · Mathematics 2025-03-31 Aleksi Anttila , Søren Brinck Knudstorp

Topological semantics for modal logics has recently gained new momentum in many different branches of logic. In this paper, we will consider the topological semantics of both classical and paraconsistent modal logics. This work is a new…

Logic · Mathematics 2011-08-19 Can Baskent

Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for…

Logic in Computer Science · Computer Science 2010-02-03 Lutz Schroeder , Dirk Pattinson

We study the relative succinctness and expressiveness of modal logics, and prove that these relationships can be as complex as any countable partial order. For this, we use two uniform formalisms to define modal operators, and obtain…

Logic in Computer Science · Computer Science 2014-10-23 Henning Schnoor

We define Boolean algebras in the linear context and study its symmetric powers. We give explicit formulae for products in symmetric Boolean algebras of various dimensions. We formulate symmetric forms of the inclusion-exclusion principle.

Combinatorics · Mathematics 2008-02-28 Rafael Diaz , Mariolys Rivas

We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra. The logic deals with atomic predicate formulas of the form of inequalities between terms and formalizes…

Logic in Computer Science · Computer Science 2015-03-24 Vilem Vychodil

In this paper we consider Modal Team Logic, a generalization of Classical Modal Logic in which it is possible to describe dependence phenomena between data. We prove that most known fragment of Full Modal Team Logic allow the elimination of…

Logic in Computer Science · Computer Science 2018-10-15 Giovanna D'Agostino

We develop a canonical form for congruence of max plus symmetric matrices. We use the same canonical form to get results in the generalized eigenvector problem. We have also utilized the canonical form to find all symmetric matrices that…

Rings and Algebras · Mathematics 2024-10-17 Himadri Mukherjee , Askar Ali M

In this work in progress, we discuss independence and interpolation and related topics for classical, modal, and non-monotonic logics.

Logic · Mathematics 2010-08-30 Dov Gabbay , Karl Schlechta

The continuous modal mu-calculus is a fragment of the modal mu-calculus, where the application of fixpoint operators is restricted to formulas whose functional interpretation is Scott-continuous, rather than merely monotone. By…

Logic in Computer Science · Computer Science 2021-09-20 Jan Rooduijn , Yde Venema

We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…

Logic in Computer Science · Computer Science 2023-10-20 Alexander V. Gheorghiu , David J. Pym

In this paper, we study logics of dependence on the propositional level. We prove that several interesting propositional logics of dependence, including propositional dependence logic, propositional intuitionistic dependence logic as well…

Logic · Mathematics 2018-12-19 Fan Yang , Jouko Väänänen

A modal logic based on quantum logic is formalized in its simplest possible form. Specifically, a relational semantics and a sequent calculus are provided, and the soundness and the completeness theorems connecting both notions are…

Logic in Computer Science · Computer Science 2025-11-14 Kenji Tokuo

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

Logic in Computer Science · Computer Science 2023-05-26 Gilles Dowek , Thérèse Hardin , Claude Kirchner

We study a natural variant of the implicational fragment of propositional logic. Its formulas are pairs of conjunctions of positive literals, related together by an implicational-like connective; the semantics of this sort of implication is…

Logic in Computer Science · Computer Science 2023-06-22 Albert Atserias , José L. Balcázar , Marie Ely Piceno

Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…

Logic in Computer Science · Computer Science 2009-02-13 Lutz Schröder , Dirk Pattinson

We extend the logical categories framework to first order modal logic. In our modal categories, modal operators are applied directly to subobjects and interact with the background factorization system. We prove a Joyal-style representation…

Logic in Computer Science · Computer Science 2025-04-07 Silvio Ghilardi , Jérémie Marquès