English
Related papers

Related papers: A note on public announcements in standard G\"odel…

200 papers

A shallow semantical embedding for public announcement logic with relativized common knowledge is presented. This embedding enables the first-time automation of this logic with off-the-shelf theorem provers for classical higher-order logic.…

Artificial Intelligence · Computer Science 2020-10-05 Sebastian Reiche , Christoph Benzmüller

In this paper we introduce public announcement logic in different geometric frameworks. First, we consider topological models, and then extend our discussion to a more expressive model, namely, subset space models. Furthermore, we prove the…

Logic in Computer Science · Computer Science 2011-08-19 Can Baskent

In this paper we introduce {\em global and local announcement logic} (GLAL), a dynamic epistemic logic with two distinct announcement operators -- $[\phi]^+_A$ and $[\phi]^-_A$ indexed to a subset $A$ of the set $Ag$ of all agents -- for…

Logic in Computer Science · Computer Science 2017-07-28 Francesco Belardinelli , Hans van Ditmarsch , Wiebe van der Hoek

In this paper, we address the logic of knowing why, an example of a non-standard epistemic logic dealing with justified knowledge via a new epistemic operator, under the extensions with ideas from dynamic epistemic logic, namely public…

Logic · Mathematics 2018-09-24 Nicholas Pischke

We show that the standard G\"odel modal logics, as initially introduced by Caicedo and Rodriguez in \cite{CR2009,CR2010}, are not realized by the basic G\"odel justification logics although being related by the forgetful projection.

Logic · Mathematics 2019-07-11 Nicholas Pischke

A shallow semantical embedding for public announcement logic with relativized common knowledge is presented. This embedding enables the first-time automation of this logic with off-the-shelf theorem provers for classical higher-order logic.…

Artificial Intelligence · Computer Science 2022-12-12 Christoph Benzmüller , Sebastian Reiche

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

We propose a multi-agent logic of knowledge, public and arbitrary announcements, that is interpreted on topological spaces in the style of subset space semantics. The arbitrary announcement modality functions similarly to the effort…

Logic in Computer Science · Computer Science 2016-06-27 Hans van Ditmarsch , Sophia Knight , Aybüke Özgün

Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of G\"odel logic. The calculi are used to establish…

Logic · Mathematics 2015-07-01 George Metcalfe , Nicola Olivetti

In this paper, we discuss models of the common knowledge logic. The common knowledge logic is a multi-modal logic that includes the modal operators $\mathsf{K}_{i}$ ($i\in\mathcal{I}$, where $\mathcal{I}$ is a finite set of agents) and…

Logic · Mathematics 2025-12-23 Yoshihito Tanaka

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

Quantification over public announcements shifts the perspective from reasoning strictly about the results of a particular announcement to reasoning about the existence of an announcement that achieves some certain epistemic goal. Depending…

Logic in Computer Science · Computer Science 2021-06-23 Hans van Ditmarsch , Tim French , Rustam Galimullin

The Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional…

Logic · Mathematics 2009-11-13 Sérgio Marcelino , Pedro Resende

Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators "t:",…

Logic · Mathematics 2021-09-07 Nicholas Pischke

In this paper we provide a simplified semantics for the logic KD45(G), i.e. the many-valued G\"odel counterpart of the classical modal logic KD45. More precisely, we characterize KD45(G) as the set of valid formulae of the class of…

Logic in Computer Science · Computer Science 2016-11-15 Félix Bou , Francesc Esteva , Lluís Godo , Ricardo Oscar Rodriguez

We consider the G\"odel bi-modal logic determined by fuzzy Kripke models where both the propositions and the accessibility relation are infinitely valued over the standard G\"odel algebra [0,1] and prove strong completeness of Fischer Servi…

Logic · Mathematics 2011-10-12 Xavier Caicedo , Ricardo Oscar Rodriguez

Proof-theoretic semantics, and base-extension semantics in particular, can be seen as a logical realization of inferentialism, in which the meaning of expressions is understood through their use. We present a base-extension semantics for…

Logic · Mathematics 2025-08-01 Timo Eckhardt , David J. Pym

Arbitrary public announcement logic (APAL) reasons about how the knowledge of a set of agents changes after true public announcements and after arbitrary announcements of true epistemic formulas. We consider a variant of arbitrary public…

Logic in Computer Science · Computer Science 2021-11-30 Hans van Ditmarsch , Tim French , James Hales

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

In [17], we introduced a modal logic, called $L$, which combines intuitionistic propositional logic $IPC$ and classical propositional logic $CPC$ and is complete w.r.t. an algebraic semantics. However, $L$ seems to be too weak for…

Logic in Computer Science · Computer Science 2015-10-20 Steffen Lewitzka
‹ Prev 1 2 3 10 Next ›