Current dynamic epistemic logics for analyzing effects of informational events often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions involving common knowledge are essential to successful multi-agent communication. We propose new systems that extend the epistemic base language with a new notion of ‘relativized common knowledge’, in such a way that the resulting full dynamic logic of information flow allows for a compositional analysis of all epistemic postconditions via perspicuous ‘reduction axioms’. We also (...) show how such systems can deal with factual alteration, rather than just information change, making them cover a much wider range of realistic events. After a warm-up stage of analyzing logics for public announcements, our main technical results are expressivity and completeness theorems for a much richer logic that we call LCC. This is a dynamic epistemic logic whose static base is propositional dynamic logic (PDL), interpreted epistemically. This system is capable of expressing all model-shifting operations with finite action models, while providing a compositional analysis for a wide range of informational events. This makes LCC a serious candidate for a standard in dynamic epistemic logic, as we illustrate by analyzing some complex communication scenarios, including sending successive emails with both ‘cc’ and ‘bcc’ lines, and other private announcements to subgroups. Our proofs involve standard modal techniques, combined with a new application of Kleene’s theorem on finite automata, as well as new Ehrenfeucht games of model comparison. (shrink)

In an information state where various agents have both factual knowledge and knowledge about each other, announcements can be made that change the state of information. Such informative announcements can have the curious property that they become false because they are announced. The most typical example of that is 'fact p is true and you don't know that', after which you know that p, which entails the negation of the announcement formula. The announcement of such a formula in a given (...) information state is called an unsuccessful update. A successful formula is a formula that always becomes common knowledge after being announced. Analysis of information systems and 'philosophical puzzles' reveals a growing number of dynamic phenomena that can be described or explained by unsuccessful updates. This increases our understanding of such philosophical problems. We also investigate the syntactic characterization of the successful formulas. (shrink)

After explaining the well-known two-envelope paradox by indicating the fallacy involved, we consider the two-envelope problem of evaluating the factual information provided to us in the form of the value contained by the envelope chosen first. We try to provide a synthesis of contributions from economy, psychology, logic, probability theory (in the form of Bayesian statistics), mathematical statistics (in the form of a decision-theoretic approach) and game theory. We conclude that the two-envelope problem does not allow a satisfactory solution. An (...) interpretation is made for statistical science at large. (shrink)

In this paper, we present several extensions of epistemic logic with update operators modelling public information change. Next to the well-known public announcement operators, we also study public substitution operators. We prove many of the results regarding expressivity and completeness using so-called reduction axioms. We develop a general method for using reduction axioms and apply it to the logics at hand.

Two groups of agents, G1 and G2, face a *moral conflict* if G1 has a moral obligation and G2 has a moral obligation, such that these obligations cannot both be fulfilled. We study moral conflicts using a multi-agent deontic logic devised to represent reasoning about sentences like "In the interest of group F of agents, group G of agents ought to see to it that phi". We provide a formal language and a consequentialist semantics. An illustration of our semantics with (...) an analysis of the Prisoner’s Dilemma follows. Next, necessary and sufficient conditions are given for (1) the possibility that a single group of agents faces a moral conflict, for (2) the possibility that two groups of agents face a moral conflict within a single moral code, and for (3) the possibility that two groups of agents face a moral conflict. (shrink)

In this paper I combine the dynamic epistemic logic ofGerbrandy (1999) with the probabilistic logic of Fagin and Halpern (1994). The resultis a new probabilistic dynamic epistemic logic, a logic for reasoning aboutprobability, information, and information change that takes higher orderinformation into account. Probabilistic epistemic models are defined, and away to build them for applications is given. Semantics and a proof systemis presented and a number of examples are discussed, including the MontyHall Dilemma.

Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any three-valued logic into a modal formula. Second, we show that for every S5-model there is an equivalent three-valued valuation and vice versa. In general, our Translation Manual gives rise to translations that are exponentially longer than their originals. This fact raises the question whether there are (...) three-valued logics for which there is a shorter translation into S5. The answer is affirmative: we present an elegant linear translation of the Logic of Paradox and of Strong Three-valued Logic into S5. (shrink)

We present Arrow Update Logic, a theory of epistemic access elimination that can be used to reason about multi-agent belief change. While the belief-changing of Arrow Update Logic can be transformed into equivalent belief-changing from the popular Dynamic Epistemic Logic approach, we prove that arrow updates are sometimes exponentially more succinct than action models. Further, since many examples of belief change are naturally thought of from Arrow Update Logicrelativized” common knowledge familiar from the Dynamic Epistemic Logic literature.

Current dynamic epistemic logics often become cumbersome and opaque when common knowledge is added. In this paper we propose new versions that extend the underlying static epistemic language in such a way that dynamic completeness proofs can be obtained by perspicuous reduction axioms.

Current dynamic-epistemic logics model different types of information change in multi-agent scenarios. We generalize these logics to a probabilistic setting, obtaining a calculus for multi-agent update with three natural slots: prior probability on states, occurrence probabilities in the relevant process taking place, and observation probabilities of events. To match this update mechanism, we present a complete dynamic logic of information change with a probabilistic character. The completeness proof follows a compositional methodology that applies to a much larger class of dynamic-probabilistic (...) logics as well. Finally, we discuss how our basic update rule can be parameterized for different update policies, or learning methods. (shrink)

Current dynamic epistemic logics often become cumbersome and opaque when common knowledge is added. In this paper we propose new versions that extend the underlying static epistemic language in such a way that dynamic completeness proofs can be obtained by perspicuous reduction axioms.

Barteld Kooi and Bryan Renne (2011). Generalized Arrow Update Logic. In K.R. Apt (editor). Theoretical Aspects of Rationality and Knowledge, Proceedings of the Thirteenth Conference (TARK 2011), pp. 205-211.

Hans van Ditmarsch and Barteld Kooi (2008). Semantic results for ontic and epistemic change. In: G. Bonanno, W. van der Hoek and M. Wooldridge (editors). Logic and the Foundations of Game and Decision Theory (LOFT 7). Texts in Logic and Games 3, pp. 87-117, Amsterdam University Press, Amsterdam.

Over the years a lot of easily computable strategies for the game mastermind have been proposed. One of the obvious strategies, guess that code that has the most possible answers, has been lacking. It is discussed in this paper.

Tim French, Wiebe van der Hoek, Petar Iliev and Barteld Kooi. Succinctness of Epistemic Languages. In: T. Walsh (editor). Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI-11), pp. 881-886, AAAI Press, Menlo Park.

Taking our inspiration from modal correspondence theory, we present the idea of correspondence analysis for many-valued logics. As a benchmark case, we study truth-functional extensions of the Logic of Paradox (LP). First, we characterize each of the possible truth table entries for unary and binary operators that could be added to LP by an inference scheme. Second, we define a class of natural deduction systems on the basis of these characterizing inference schemes and a natural deduction system for LP. Third, (...) we show that each of the resulting natural deduction systems is sound and complete with respect to its particular semantics. (shrink)

Dynamic Epistemic Logic This article tells the story of the rise of dynamic epistemic logic, which began with epistemic logic, the logic of knowledge, in the 1960s. Then, in the late 1980s, came dynamic epistemic logic, the logic of change of knowledge. Much of it was motivated by puzzles and paradoxes. The number … Continue reading Dynamic Epistemic Logic →.

According to the expression account, assertion is the linguistic expression of belief. Given the knowledge rule of belief, this entails that knowledge is a normative requirement of sincere assertions. On this account, which is defended in Hindriks , knowledge can be a normative requirement of sincere assertions even though there is no knowledge rule that is constitutive of assertion. Ball criticizes this claim arguing that the derivation of the knowledge rule equivocates between epistemic and moral senses of obligation. In response, (...) we resist the charge of equivocation. Ball does not, after all, demonstrate that the distinction matters in the context at issue. In addition to this, we argue that it is a virtue of the account that the knowledge rule is restricted in application to sincere assertions. The case we present to illustrate this is that of the virtuous liar who knows what he believes, and is insincere because that is the right thing to do in the situation. It makes no sense, we suggest, to criticize the liar for not knowing that which he asserts. After all, it is his moral duty to assert what he knows to be false. Furthermore, his epistemic standing is impeccable, as he knows what he believes. (shrink)

According to the expression account, assertion is the linguistic expression of belief. Given the knowledge rule of belief, this entails that knowledge is a normative requirement of sincere assertions. On this account, which is defended in Hindriks, knowledge can be a normative requirement of sincere assertions even though there is no knowledge rule that is constitutive of assertion. Ball criticizes this claim arguing that the derivation of the knowledge rule equivocates between epistemic and moral senses of obligation. In response, we (...) resist the charge of equivocation. Ball does not, after all, demonstrate that the distinction matters in the context at issue. In addition to this, we argue that it is a virtue of the account that the knowledge rule is restricted in application to sincere assertions. The case we present to illustrate this is that of the virtuous liar who knows what he believes, and is insincere because that is the right thing to do in the situation. It makes no sense, we suggest, to criticize the liar for not knowing that which he asserts. After all, it is his moral duty to assert what he knows to be false. Furthermore, his epistemic standing is impeccable, as he knows what he believes. (shrink)

We provide a strongly complete infinitary proof system for hybrid logic. This proof system can be extended with countably many sequents. Thus, although these logics may be non-compact, strong completeness proofs are provided for infinitary hybrid versions of non-compact logics like ancestral logic and Segerberg’s modal logic with the bounded chain condition. This extends the completeness result for hybrid logics by Gargov, Passy, and Tinchev.

Hans van Ditmarsch, Wiebe van der Hoek and Barteld Kooi (2011). Reasoning about local properties in modal logic. In K. Tumer and P. Yolum and L. Sonenberg and P. Stone (editors). Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), pp. 711-718.

abstract. A first-order dynamic epistemic logic is developed where the names of the agents are also terms in the sense of first-order logic. Consequently one can quantify over epistemic modalities. Us- ing constructs from dynamic logic one can express many interesting concepts. First-order update models are developed and added to the language as modalities.