Since the work of Plaza (1989) about acts of public communication, a lot of dynamic epistemic logic systems have emerged. A general state of the art can be found in van Ditmarsch et al. (2007). Such logics model situations in which some announcements can be made and after an announcement, the situations which are incompatible with it are deleted from the model. In this paper we propose a reconstruction of the logic PAC (Public Announcement logic with Common Knowledge, see van (...) Ditmarsch et al. (2007)) through the dialogical framework. The idea of this work is to rediscover announcements as acts: acts of an arguer during an argumentative dialogue about knowledge change of agents instead of "model-modifiers". We name this reconstruction DEMAL for Dialogical Epistemic Multi-Agent Logic. (shrink)

We look at lying as an act of communication, where (i) the proposition that is communicated is not true, (ii) the utterer of the lie knows that what she communicates is not true, and (iii) the utterer of the lie intends the lie to be taken as truth. Rather than dwell on the moral issues, we provide a sketch of what goes on logically when a lie is communicated. We present a complete logic of manipulative updating, to analyse the effects (...) of lying in public discourse. Next, we turn to the study of lying in games. First, a game-theoretical analysis is used to explain how the possibility of lying makes such games interesting, and how lying is put to use in optimal strategies for playing the game. Finally, we give a matching logical analysis. Our running example of lying in games in liar’s dice. (shrink)

Syntactic logics do not suffer from the problems of logical omniscience but are often thought to lack interesting properties relating to epistemic notions. By focusing on the case of rule-based agents, I develop a framework for modelling resource-bounded agents and show that the resulting models have a number of interesting properties.

``Pluralistic ignorance'' is a phenomenon mainly studied in social psychology. Viewed as an epistemic phenomenon, one way to define it is as a situation where ``no one believes, but everyone believes that everyone else believes''. In this paper various versions of pluralistic ignorance are formalized using epistemic/doxastic logic. The motive is twofold. Firstly, the formalizations are used to show that the various versions of pluralistic ignorance are all consistent, thus there is nothing in the phenomenon that necessarily goes against logic. (...) Secondly, pluralistic ignorance, is on many occasions, assumed to be fragile. In this paper, however, it is shown that pluralistic ignorance need not be fragile to announcements of the agents' beliefs. Hence, to dissolve pluralistic ignorance in general, something more than announcements of the subjective views of the agents is needed. Finally, suggestions to further research are outlined. (shrink)

Predictive accounts of belief ascription, either following the principle of charity or Dennett's intentional stance, have proved popular recently. However, such accounts require us first to treat agents as perfectly rational agents and then revise this assumption as appropriate. I argue that such downwards revision is no easy task and that several proposed accounts are not satisfactory. I propose a way of characterising agent's belief states which shares Dennett's approach but avoids treating agents as perfectly rational, and develop a formal (...) account in terms of fan models. (shrink)

The early literature on epistemic logic in philosophy focused on reasoning about the knowledge or belief of a single agent, especially on controversies about "introspection axioms" such as the 4 and 5 axioms. By contrast, the later literature on epistemic logic in computer science and game theory has focused on multi-agent epistemic reasoning, with the single-agent 4 and 5 axioms largely taken for granted. In the relevant multi-agent scenarios, it is often important to reason about what agent A believes about (...) what agent B believes about what agent A believes; but it is rarely important to reason just about what agent A believes about what agent A believes. This raises the question of the extent to which single-agent introspection axioms actually matter for multi-agent epistemic reasoning. In this paper, we formalize and answer this question. To formalize the question, we first define a set of multi-agent formulas that we call agent-alternating formulas, including formulas like Box_a Box_b Box_a p but not formulas like Box_a Box_a p. We then prove, for the case of belief, that if one starts with multi-agent K or KD, then adding both the 4 and 5 axioms (or adding the B axiom) does not allow the derivation of any new agent-alternating formulas—in this sense, introspection axioms do not matter. By contrast, we show that such conservativity results fail for knowledge and multi-agent KT, though they hold with respect to a smaller class of agent-nonrepeating formulas. (shrink)

This thesis is on information dynamics modeled using *dynamic epistemic logic*. It takes the simple perspective of identifying models with maps, which under a suitable topology may be analyzed as *topological dynamical systems*. It is composed of an introduction and six papers. The introduction situates DEL in the field of formal epistemology, exemplifies its use and summarizes the main contributions of the papers.Paper I models the information dynamics of the *bystander effect* from social psychology. It shows how augmenting the standard (...) machinery of DEL with a decision making framework yields mathematically self-contained models of dynamic processes, a prerequisite for rigid model comparison.Paper II extrapolates from Paper I's construction, showing how the augmentation and its natural peers may be construed as maps. It argues that under the restriction of dynamics produced by DEL dynamical systems still falls a collection rich enough to be of interest. Paper III compares the approach of Paper II with *extensional protocols*, the main alternative augmentation to DEL. It concludes that both have benefits, depending on application. In favor of the DEL dynamical systems, it shows that extensional protocols designed to mimic simple, DEL dynamical systems require infinite representations. Paper IV focuses on *topological dynamical systems*. It argues that the *Stone topology* is a natural topology for investigating logical dynamics as, in it, *logical convergence* coinsides with topological convergence. It investigates the recurrent behavior of the maps of Papers II and III, providing novel insigths on their long-term behavior, thus providing a proof of concept for the approach.Paper V lays the background for Paper IV, starting from the construction of metrics generalizing the Hamming distance to infinite strings, inducing the Stone topology. It shows that the Stone topology is unique in making logical and topological convergens coinside, making it the natural topology for logical dynamics. It further includes a metric-based proof that the hitherto analyzed maps are continuous with respect to the Stone topology. Paper VI presents two characterization theorems for the existence of *reduction laws*, a common tool in obtaining complete dynamic logics. In the compact case, continuity in the Stone topology characterizes existence, while a strengthening is required in the non-compact case. The results allow the recasting of many logical dynamics of contemporary interest as topological dynamical systems. (shrink)

The notion of perfect recall in extensive games was introduced by Kuhn (1953), who interpreted it as "equivalent to the assertion that each player is allowed by the rules of the game to remember everything he knew at previous moves and all of his choices at those moves''. We provide a characterization and axiomatization of perfect recall based on two notions of memory: (1) memory of past knowledge and (2) memory of past actions.

The paper outlines an epistemic logic based on the proof theory of substructural logics. The logic is a formal model of belief that i) is based on true assumptions (BTA belief) and ii) does not suffer from the usual omniscience properties.

We present a direct reduction of dynamic epistemic logic in the spirit of [4] to propositional dynamic logic (PDL) [17, 18] by program transformation. The program transformation approach associates with every update action a transformation on PDL programs. These transformations are then employed in reduction axioms for the update actions. It follows that the logic of public announcement, the logic of group announcements, the logic of secret message passing, and so on, can all be viewed as subsystems of PDL. Moreover, (...) the program transformation approach can be used to generate the appropriate reduction axioms for these logics. Our direct reduction of dynamic epistemic logic to PDL was inspired by the reduction of dynamic epistemic logic to automata PDL of [13]. Our approach shows how the detour through automata can be avoided. (shrink)

We consider strategic-form games with ordinal payoffs and provide a syntactic analysis of common belief/knowledge of rationality, which we define axiomatically. Two axioms are considered. The first says that a player is irrational if she chooses a particular strategy while believing that another strategy is better. We show that common belief of this weak notion of rationality characterizes the iterated deletion of pure strategies that are strictly dominated by pure strategies. The second axiom says that a player is irrational if (...) she chooses a particular strategy while believing that a different strategy is at least as good and she considers it possible that this alternative strategy is actually better than the chosen one. We show that common knowledge of this stronger notion of rationality characterizes the restriction to pure strategies of the iterated deletion procedure introduced by Stalnaker (1994). Frame characterization results are also provided. (shrink)