SearcharxivSearch

arXiv · math/0608166

Epistemic actions as resources

Abstract

We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommodate incomplete as well as wrong information e.g.due to secrecy and deceit, as well as nested knowledge. We give a purely algebraic treatment of the muddy children puzzle, which moreover extends to situations where the children are allowed to lie and cheat. Epistemic actions, that is, information exchanges between agents, are modeled as elements of a quantale. The quantale acts on an underlying right module of epistemic propositions and facts. The epistemic content is encoded by appearance maps, one pair of (lax) morphisms for each agent, which preserve the module and quantale structure respectively. By adjunction, they give rise to epistemic modalities, capturing the agents' knowledge on propositions and actions. The module action is epistemic update and gives rise to dynamic modalities - cf. weakest precondition. This model subsumes the crucial fragment of Baltag, Moss and Solecki's dynamic epistemic logic, abstracting it in a constructive fashion while introducing resource-sensitive structure on the epistemic actions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexandru Baltag, Bob Coecke, Mehrnoosh Sadrzadeh. 2007-03-05. Epistemic actions as resources. https://arxiv.org/abs/math/0608166

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO