English
Related papers

Related papers: Inquisitive bisimulation

200 papers

We study an intuitionistic version of common knowledge logic (CK), called ICK, which was introduced by J\"ager and Marti. ICK extends intuitionistic propositional logic (IPL) by multiple box modalities interpreted as knowledge operators for…

Logic · Mathematics 2026-05-04 Lukas Zenger

We investigate multi-agent epistemic modal logic with common knowledge modalities for groups of agents and obtain van Benthem style model-theoretic characterisations, in terms of bisimulation invariance of classical first-order logic over…

Logic · Mathematics 2021-12-22 Felix Canavoi , Martin Otto

This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of Linear Logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have…

Logic in Computer Science · Computer Science 2015-09-07 Daniele Porello , Nicolas Troquard

We present a modal logic based approach to the so-called endophysical quantum universe. In particular, we treat the problem of preferred bases and that of state reduction by employing an eclectic collection of methods including Baltag's…

Quantum Physics · Physics 2007-05-23 A. M. Lisewski

Impure simplicial complexes are a powerful tool to model multi-agent epistemic situations where agents may die, but it is difficult to define a satisfactory semantics for the ordinary propositional modal language on such models, since many…

Logic in Computer Science · Computer Science 2025-12-01 Yuanzhe Yang

Under the Curry--Howard isomorphism, the syntactic structure of programs can be modeled using birelational Kripke structures equipped with intuitionistic and modal relations. Intuitionistic relations capture scoping through persistence,…

Logic in Computer Science · Computer Science 2026-02-11 Yuito Murase , Akinori Maniwa

We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of a given logic and relational structures used to define the…

Logic in Computer Science · Computer Science 2011-03-02 Zoran Majkic

Uniform interpolation is the property that, for any formula and set of atoms, there exists the strongest consequence omitting those atoms. It plays a central role in knowledge representation and reasoning tasks such as knowledge update and…

Logic in Computer Science · Computer Science 2026-03-31 Kexu Wang , Liangda Fang

We introduce a modal logic for describing statistical knowledge, which we call statistical epistemic logic. We propose a Kripke model dealing with probability distributions and stochastic assignments, and show a stochastic semantics for the…

Logic in Computer Science · Computer Science 2023-07-19 Yusuke Kawamoto

Inquisitive team logic is a variant of inquisitive logic interpreted in team semantics, which has been argued to provide a natural setting for the regimentation of dependence claims. With respect to sentences, this logic is known to be…

Logic · Mathematics 2026-03-10 Juha Kontinen , Ivano Ciardelli

In this paper, we define a multi-type calculus for inquisitive logic, which is sound, complete and enjoys Belnap-style cut-elimination and subformula property. Inquisitive logic is the logic of inquisitive semantics, a semantic framework…

Logic in Computer Science · Computer Science 2016-04-05 Sabine Frittella , Giuseppe Greco , Alessandra Palmigiano , Fan Yang

We study model and frame definability of various modal logics. Let ML(A+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We show that a class of Kripke models…

Logic · Mathematics 2018-12-17 Katsuhiko Sano , Jonni Virtema

In probabilistic transition systems, behavioural metrics provide a more fine-grained and stable measure of system equivalence than crisp notions of bisimilarity. They correlate strongly to quantitative probabilistic logics, and in fact the…

Logic in Computer Science · Computer Science 2019-06-05 Paul Wild , Lutz Schröder , Dirk Pattinson , Barbara König

Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete…

Logic in Computer Science · Computer Science 2015-09-25 Lauri Hella , Johanna Stumpf

We consider bisimulation-invariant monadic second-order logic over various classes of finite transition systems. We present several combinatorial characterisations of when the expressive power of this fragment coincides with that of the…

Logic in Computer Science · Computer Science 2019-05-17 Achim Blumensath , Felix Wolf

We propose a many-sorted modal logic for reasoning about knowledge in multi-agent systems. Our logic introduces a clear distinction between participating agents and the environment. This allows to express local properties of agents and…

Logic in Computer Science · Computer Science 2023-08-02 Eric Goubault , Roman Kniazev , Jérémy Ledent

Standard epistemic logics introduce a modal operator K to represent knowledge, but in doing so they presuppose the logical apparatus they aim to explain. By contrast, this paper explores how logic may be derived from the structure of…

Logic in Computer Science · Computer Science 2025-12-01 Alexader V. Gheorghiu , Tao Gu

We define a new logic-induced notion of bisimulation (called $\rho$-bisimulation) for coalgebraic modal logics given by a logical connection, and investigate its properties. We show that it is structural in the sense that it is defined only…

Logic in Computer Science · Computer Science 2020-08-24 Jim de Groot , Helle Hvid Hansen , Alexander Kurz

Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. Similar to well-known results for monadic second-order logic over trees,…

Logic in Computer Science · Computer Science 2015-01-29 Sebastian Enqvist , Fatemeh Seifan , Yde Venema

We present a straightforward embedding of quantified multimodal logic in simple type theory and prove its soundness and completeness. Modal operators are replaced by quantification over a type of possible worlds. We present simple…

Artificial Intelligence · Computer Science 2009-05-18 Christoph Benzmueller , Lawrence C. Paulson