English
Related papers

Related papers: A Coalgebraic Semantics for Intuitionistic Modal L…

200 papers

We introduce a monotone modal analogue of the intuitionistic (normal) modal logic IK using a translation into a suitable (intuitionistic) first-order logic. We axiomatise the logic and give a semantics by means of intuitionistic…

Logic · Mathematics 2025-07-21 Jim de Groot

The present work presents some results about the categorial relation between logics and its categories of structures. A (propositional, finitary) logic is a pair given by a signature and Tarskian consequence relation on its formula algebra.…

Category Theory · Mathematics 2016-03-04 Darllan Conceição Pinto , Hugo Luiz Mariano

We present a finitary version of Moss' coalgebraic logic for $T$-coalgebras, where $T$ is a locally monotone endofunctor of the category of posets and monotone maps. The logic uses a single cover modality whose arity is given by the least…

Logic in Computer Science · Computer Science 2023-06-22 Marta Bílková , Matěj Dostál

In this paper, we present an abstract framework of many-valued modal logic with the interpretation of atomic propositions and modal operators as predicate lifting over coalgebras for an endofunctor on the category of sets. It generalizes…

Logic in Computer Science · Computer Science 2022-10-25 Chun-Yu Lin , Churn-Jung Liau

A modal logic that is strong enough to fully characterize the behavior of a system is called expressive. Recently, with the growing diversity of systems to be reasoned about (probabilistic, cyber-physical, etc.), the focus shifted to…

Logic in Computer Science · Computer Science 2021-05-24 Yuichi Komorida , Shin-ya Katsumata , Clemens Kupke , Jurriaan Rot , Ichiro Hasuo

We introduce a proof language for Intuitionistic Multiplicative Additive Linear Logic (IMALL), extended with a modality B to capture mixed-state quantum computation. The language supports algebraic constructs such as linear combinations,…

Logic in Computer Science · Computer Science 2025-12-22 Kinnari Dave , Alejandro Díaz-Caro , Vladimir Zamdzhiev

Frames provide redundant, stable representations of data which have important applications in signal processing. We introduce a connection between symplectic geometry and frame theory and show that many important classes of frames have…

Functional Analysis · Mathematics 2021-08-11 Tom Needham , Clayton Shonkwiler

We present a coalgebraic framework for studying generalisations of dynamic modal logics such as PDL and game logic in which both the propositions and the semantic structures can take values in an algebra $\mathbf{A}$ of truth-degrees. More…

Logic in Computer Science · Computer Science 2025-12-30 Helle Hvid Hansen , Wolfgang Poiger

Prime implicates and prime implicants have proven relevant to a number of areas of artificial intelligence, most notably abductive reasoning and knowledge compilation. The purpose of this paper is to examine how these notions might be…

Logic in Computer Science · Computer Science 2014-01-16 Meghyn Bienvenu

For each natural number $n$ we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than $n$ and no strictly ascending chains. The case $n=0$ is the G\"odel-L\"ob…

Logic · Mathematics 2023-11-08 Robert Goldblatt

Coinductive definitions, such as that of an infinite stream, may often be described by elegant logic programs, but ones for which SLD-refutation is of no value as SLD-derivations fall into infinite loops. Such definitions give rise to…

Programming Languages · Computer Science 2013-12-24 Ekaterina Komendantskaya , John Power , Martin Schmidt

In this paper, we introduce $\textit{partial}$ dependency modality $\mathcal{D}$ into epistemic logic so as to reason about $\textit{partial}$ dependency relationship in Kripke models. The resulted dependence epistemic logic possesses…

Logic · Mathematics 2019-08-28 Xinyu Wang

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

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 develop a uniform coalgebraic approach to J\'onsson-Tarski and Thomason type dualities for various classes of neighborhood frames and neighborhood algebras. In the first part of the paper we construct an endofunctor on the category of…

Logic in Computer Science · Computer Science 2023-06-22 Guram Bezhanishvili , Nick Bezhanishvili , Jim de Groot

We propose a "modal linear logic" to reformulate intuitionistic modal logic S4 (IS4) in terms of linear logic, establishing an S4-version of Girard translation from IS4 to it. While the Girard translation from intuitionistic logic to linear…

Logic in Computer Science · Computer Science 2019-04-25 Yosuke Fukuda , Akira Yoshimizu

We describe the (equivariant) intersection cohomology of certain moduli spaces ("framed Uhlenbeck spaces") together with some structures on them (such as e.g.\ the Poincar\'e pairing) in terms of representation theory of some vertex…

Quantum Algebra · Mathematics 2016-10-27 Alexander Braverman , Michael Finkelberg , Hiraku Nakajima

We further develop the algebraic approach to input/output logic initiated in \cite{wollic22}, where subordination algebras and a family of their generalizations were proposed as a semantic environment of various input/output logics. In…

Logic in Computer Science · Computer Science 2024-12-03 Andrea De Domenico , Ali Farjami , Krishna Manoorkar , Alessandra Palmigiano , Mattia Panettiere , Xiaolong Wang

We introduce continuation semantics for both fixpoint modal logic (FML) and Computation Tree Logic* (CTL*), parameterised by a choice of branching type and quantitative predicate lifting. Our main contribution is proving that they are…

Logic in Computer Science · Computer Science 2026-03-03 Ryota Kojima , Corina Cirstea

In previous work, Abramsky, Dawar and Wang (LiCS 2017) and Abramsky and Shah (CSL 2018) have shown how a range of model comparison games which play a central role in finite model theory, including Ehrenfeucht-Fraisse, pebbling, and…

Logic in Computer Science · Computer Science 2021-05-14 Samson Abramsky , Dan Marsden