English
Related papers

Related papers: Inquisitive bisimulation

200 papers

This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of…

Logic in Computer Science · Computer Science 2024-11-13 Alexander V. Gheorghiu , Tao Gu , David J. Pym

The definition is a common form of human expert knowledge, a building block of formal science and mathematics, a foundation for database theory and is supported in various forms in many knowledge representation and formal specification…

Logic in Computer Science · Computer Science 2017-02-16 Marc Denecker , Bart Bogaerts , Joost Vennekens

Temporal epistemic logic is a well-established framework for expressing agents knowledge and how it evolves over time. Within language-based security these are central issues, for instance in the context of declassification. We propose to…

Cryptography and Security · Computer Science 2012-09-03 Musard Balliu , Mads Dam , Gurvan Le Guernic

The intuitionistic modal logics considered between Constructive K (CK) and Intuitionistic K (IK) differ in their treatment of the possibility (diamond) connective. It was recently rediscovered that some logics between CK and IK also…

Logic in Computer Science · Computer Science 2025-04-23 Jim de Groot , Ian Shillito , Ranald Clouston

A probabilistic propositional logic, endowed with an epistemic component for asserting (non-)compatibility of diagonizable and bounded observables, is presented and illustrated for reasoning about the random results of projective…

Logic · Mathematics 2018-03-20 A. Sernadas , J. Rasga , C. Sernadas , L. Alcácer , A. B. Henriques

We give a novel approach to proving soundness and completeness for a logic (henceforth: the object-logic) that bypasses truth-in-a-model to work directly with validity. Instead of working with specific worlds in specific models, we reason…

Logic in Computer Science · Computer Science 2022-10-12 Alexander V. Gheorghiu , David J. Pym

Game comonads provide categorical semantics for comparison games in Finite Model Theory, thus providing an abstract characterisation of logical equivalence for a wide range of logics, each one captured through a specific choice of comonad.…

Logic in Computer Science · Computer Science 2024-08-15 Santiago Figueira , Gabriel Goren-Roig

Modal description logics feature modalities that capture dependence of knowledge on parameters such as time, place, or the information state of agents. E.g., the logic S5-ALC combines the standard description logic ALC with an S5-modality…

Logic in Computer Science · Computer Science 2017-05-24 Paul Wild , Lutz Schröder

The paper presents an extension of temporal epistemic logic with operators that quantify over strategies. The language also provides a natural way to represent what agents would know were they to be aware of the strategies being used by…

Logic in Computer Science · Computer Science 2014-04-04 Xiaowei Huang , Ron van der Meyden

We study bisimulations for useful description logics. The simplest among the considered logics is $\mathcal{ALC}_{reg}$ (a variant of PDL). The others extend that logic with inverse roles, nominals, quantified number restrictions, the…

Logic in Computer Science · Computer Science 2015-02-20 Ali Rezaei Divroodi , Linh Anh Nguyen

We give a new coalgebraic semantics for intuitionistic modal logic with $\Box$. In particular, we provide a colagebraic representation of intuitionistic descriptive modal frames and of intuitonistic modal Kripke frames based on image-finite…

Logic · Mathematics 2024-06-18 Rodrigo Nicolau Almeida , Nick Bezhanishvili

Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…

General Mathematics · Mathematics 2007-05-23 Alexander Sakharov

In this paper we present {\em refinement modal logic}. A refinement is like a bisimulation, except that from the three relational requirements only `atoms' and `back' need to be satisfied. Our logic contains a new operator 'all' in addition…

Logic in Computer Science · Computer Science 2018-02-06 Laura Bozzelli , Hans van Ditmarsch , Tim French , James Hales , Sophie Pinchinat

Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…

Logic · Mathematics 2016-05-02 Silvio Ghilardi , Samuel J. van Gool

Non-iterative normal modal logics are defined by axioms of modal degree 1. In this paper we use calculations with normal forms to determine the set of all possible non-iterative normal modal logics, unimodal propositional extensions of K.…

Logic · Mathematics 2021-03-26 Adrian Soncodi

The one-variable fragment of a first-order logic may be viewed as an "S5-like" modal logic, where the universal and existential quantifiers are replaced by box and diamond modalities, respectively. Axiomatizations of these modal logics have…

Logic · Mathematics 2024-11-20 Petr Cintula , George Metcalfe , Naomi Tokuda

This paper extends implication-space semantics to include first-order quantification. Implication-space semantics has recently been introduced as an inferentialist formal semantics that can capture nonmonotonic and nontransitive material…

Logic · Mathematics 2026-02-17 Ulf Hlobil

Based on the ideas of quantum theory of open systems (QTOS) we propose the consistent approach to study probabilistic many-valued propositional logic of intelligent devices that are composed from separate but interconnected logical units.…

Quantum Physics · Physics 2013-01-24 E. D. Vol

This paper investigates the contingency of logic within the framework of possible world semantics. Possible world semantics captures the meaning of necessitation, i.e., a statement is necessarily true if it holds in all possible worlds.…

The study of modal logic has witnessed tremendous development following the introduction of Kripke semantics. However, recent developments in programming languages and type theory have led to a second way of studying modalities, namely…

Logic in Computer Science · Computer Science 2024-05-09 G. A. Kavvos