We propose a general framework for dynamic epistemic logics. It consists of a generic language for DELs and a class of structures, called model transition systems, that describe model transformations in a static way. An MTS can be viewed as a two-layered Kripke model and consequently inherits standard concepts such as bisimulation and bounded morphism from the ordinary Kripke models. In the second half of this article we add the global operator to the language, which enables us to define the (...) notions of a canonical MTS and canonicity of a DEL formula for a property of MTSs. Using these notions, we clarify correspondences between axioms of DELs and properties of MTSs. (shrink)

The 1985 paper by Carlos Alchourrón, Peter Gärdenfors, and David Makinson, “On the Logic of Theory Change: Partial Meet Contraction and Revision Functions” was the starting-point of a large and rapidly growing literature that employs formal models in the investigation of changes in belief states and databases. In this review, the first twenty-five years of this development are summarized. The topics covered include equivalent characterizations of AGM operations, extended representations of the belief states, change operators not included in the original (...) framework, iterated change, applications of the model, its connections with other formal frameworks, computatibility of AGM operations, and criticism of the model. (shrink)

We now move to the demonstration of the left-to-right direction of the equivalence result. Let us assume that there is a winning $$\mathbf {P}$$ P -strategy in the dialogical game for $$\varphi $$ φ.

In unconditionally secure protocols, a sender and receiver are able to communicate their secrets to each other without the eavesdropper(s) being able to learn the secret, even when the eavesdropper intercepts the entire communication. We investigate such protocols for the special case of deals of cards over players, where two players aim to communicate to each other their hand of cards without the remaining player(s) learning a single card from either hand. In this contribution we show that a particular protocol (...) of length strictly larger than two (i.e., consisting of more than just one announcement by one player, and one other announcement by the other player) is after all not acceptable, and therefore does not constitute a new solution. The demonstration requires a detailed case-based analysis. The result may bring a general approach to arbitrary finite-length protocols closer. (shrink)

In this paper we investigate a logic for modelling individual and collective acceptances that is called acceptance logic. The logic has formulae of the form $A_{Gx} \phi $ reading 'if the agents in the set of agents G identify themselves with institution x then they together accept that φ'. We extend acceptance logic by two kinds of dynamic modal operators. The first kind are public announcements of the form x!ψ, meaning that the agents learn that ψ is the case in (...) context x. Formulae of the form [x!ψ]φ mean that φ is the case after every possible occurrence of the event x!ψ. Semantically, public announcements diminish the space of possible worlds accepted by agents and sets of agents. The announcement of ψ in context x makes all ¬ψ-Worlds inaccessible to the agents in such context. In this logic, if the set of accessible worlds of G in context x is empty, then the agents in G are not functioning as members of x, they do not identify themselves with x. In such a situation the agents in G may have the possibility to join x. To model this we introduce here a second kind of dynamic modal operator of acceptance shifting of the form G:x↑ψ. The latter means that the agents in G shift (change) their acceptances in order to accept ψ in context x. Semantically, they make ψ-worlds accessible to G in the context x, which means that, after such operation, G is functioning as member of x (unless there are no ψ-worlds). We show that the resulting logic has a complete axiomatization in terms of reduction axioms for both dynamic operators. In the paper we also show how the logic of acceptance and its dynamic extension can be used to model some interesting aspects of judgement aggregation. In particular, we apply our logic of acceptance to a classical scenario in judgment aggregation, the so-called 'doctrinal paradox' or 'discursive dilemma' (Pettit, Philosophical Issues 11: 268-299, 2001; Kornhauser and Sager, Yale Law Journal 96: 82-117, 1986). (shrink)

We examine a special case of inquiry games and give an account of the informational import of asking questions. We focus on yes-or-no questions, which always carry information about the questioner's strategy, but never about the state of Nature, and show how strategic information reduces uncertainty through inferences about other players' goals and strategies. This uncertainty cannot always be captured by information structures of classical game theory. We conclude by discussing the connection with Gricean pragmatics and contextual constraints on interpretation.

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)

In this paper, we propose a dynamic epistemic framework to capture the knowledge evolution in multi-agent systems where agents are not able to observe. We formalize multi-agent conformant planning with group knowledge, and reduce planning problems to model checking problems. We prove that multi-agent conformant planning with group knowledge is Pspace -complete on the size of dynamic epistemic models. We also consider the alternative Kripke semantics, and show that for each Kripke model with perfect recall and no miracles, there is (...) an equivalent dynamic epistemic model and vice versa. (shrink)

This paper proposes new semantics for propositional dynamic logic (PDL), replacing the standard relational semantics. Under these new semantics, program execution is represented as fundamentally deterministic (i.e., functional), while nondeterminism emerges as an epistemic relationship between the agent and the system: intuitively, the nondeterministic outcomes of a given process are precisely those that cannot be ruled out in advance. We formalize these notions using topology and the framework of dynamic topological logic (DTL) (Kremer and Mints in Ann Pure Appl Logic (...) 131:133–158, 2005). We show that DTL can be used to interpret the language of PDL in a manner that captures the intuition above, and moreover that continuous functions in this setting correspond exactly to deterministic processes. We also prove that certain axiomatizations of PDL remain sound and complete with respect to the corresponding classes of dynamic topological models. Finally, we extend the framework to incorporate knowledge using the machinery of subset space logic (Dabrowski et al. in Ann Pure Appl Logic 78:73–110, 1996), and show that the topological interpretation of public announcements as given in Bjorndahl (in: van Ditmarsch and Sandu (eds) Jaakko Hintikka on knowledge and game theoretical semantics, outstanding contributions to Logic, vol 12, Springer, 2018) coincides exactly with a natural interpretation of test programs. (shrink)

In this work we summarise the concept of bisimulation, widely used both in computational sciences and in modal logic, that characterises modal structures with the same behaviour in terms of accessibility relations. Then, we offer a sketch of categorical interpretation of bisimulation between modal structures, which comprise both the structure and the valuation from a propositional language.

In this paper, I will develop a set of boulesic-doxastic tableau systems and prove that they are sound and complete. Boulesic-doxastic logic consists of two main parts: a boulesic part and a doxastic part. By ‘boulesic logic’ I mean ‘the logic of the will’, and by ‘doxastic logic’ I mean ‘the logic of belief’. The first part deals with ‘boulesic’ concepts, expressions, sentences, arguments and theorems. I will concentrate on two types of boulesic expression: ‘individual x wants it to be (...) the case that’ and ‘individual x accepts that it is the case that’. The second part deals with ‘doxastic’ concepts, expressions, sentences, arguments and theorems. I will concentrate on two types of doxastic expression: ‘individual x believes that’ and ‘it is imaginable to individual x that’. Boulesic-doxastic logic investigates how these concepts are related to each other. Boulesic logic is a new kind of logic. Doxastic logic has been around for a while, but the approach to this branch of logic in this paper is new. Each system is combined with modal logic with two kinds of modal operators for historical and absolute necessity and predicate logic with necessary identity and ‘possibilist’ quantifiers. I use a kind of possible world semantics to describe the systems semantically. I also sketch out how our basic language can be extended with propositional quantifiers. All the systems developed in this paper are new. (shrink)

En este ensayo exploramos una perspectiva epistemológica en la que el elemento social y colectivo del conocimiento juega un papel fundamental en la explicación de su producción y transmisión. Primero presentamos y criticamos una posición individualista que ha sido dominante en la epistemología contemporánea y cuyas raíces pueden trazarse, al menos, hasta Descartes. Posteriormente introducimos y defendemos nuestra propia mirada, una en la que el conocimiento es un proceso constituido por un conjunto de actividades y prácticas que tiene un carácter (...) material. (shrink)

We propose a multi-agent logic of knowledge, public announcements and arbitrary announcements, interpreted on topological spaces in the style of subset space semantics. The arbitrary announcement modality functions similarly to the effort modality in subset space logics, however, it comes with intuitive and semantic differences. We provide axiomatizations for three logics based on this setting, with S5 knowledge modality, and demonstrate their completeness. We moreover consider the weaker axiomatizations of three logics with S4 type of knowledge and prove soundness and (...) completeness results for these systems. (shrink)

The paper develops an interface between syntax-based logical models of awareness and dynamic epistemic logic. The framework is shown to be able to accommodate a variety of notions of awareness and knowledge, as well as their dynamics. This, it is argued, offers a natural formal environment for the analysis of epistemic phenomena typical of multi-agent information exchange, such as how agents become aware of relevant details, how they perform inferences and how they share their information within a group. Technically, the (...) logics presented are all simple refinements of the logic of public announcements. (shrink)

We explore the possibilities that dynamic epistemic logic offers to model abductive reasoning. We show that many of the problems with formal approaches to abduction based on classical logic can be solved when considering an epistemic agent that reasons and acts.Exploramos las posibilidades que ofrece la lógica epistémica dinámica para modelar el razonamiento abductivo. Mostramos que muchos de los problemas que encuentran los tratamientos formales de la abducción basados en lógica clásica pueden ser resueltos al considerar un agente epistémico que (...) razona y actúa. (shrink)

Computer software is written in languages like C, Java or Haskell. In many cases social software is expressed in natural language. The paper explores connections between the areas of natural language analysis and analysis of social protocols, and proposes an extended program for natural language semantics, where the goals of natural language communication are derived from the demands of specific social protocols.

Formal dialogue systems model rule-based interaction between agents and as such have multiple applications in multi-agent systems and AI more generally. Their conceptual roots are in formal theories of natural argumentation, of which Hamblin’s formal systems of argumentation in Hamblin (Fallacies. Methuen, London, 1970, Theoria 37:130–135, 1971) are some of the earliest examples. Hamblin cites the medieval theory of obligationes as inspiration for his development of formal argumentation. In an obligatio, two agents, the Opponent and the Respondent, engage in an (...) alternating-move dialogue, where the Respondent’s actions are governed by certain rules, and the goal of the dialogue is establishing the consistency of a proposition. We implement obligationes in the formal dialogue system framework of Prakken (Knowl Eng Rev 21(2):163–188, 2006) using Dynamic Epistemic Logic (van Ditmarsch et al. in Dynamic epistemic logic, Synthese Library Series. Springer, Berlin, 2007). The result is a new type of inter-agent dialogue, for consistency-checking, and analyzing obligationes in this way also sheds light on interpretational and historical questions concerning their use and purpose in medieval academia. (shrink)

• We study a new composition operation on (epistemic) multiagent models and update actions that takes vocabulary extensions into account.

Public announcement logic is an extension of multiagent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose an extension of public announcement logic with a dynamic modal operator that expresses what is true after any announcement: after which , does it hold that Kφ? We give various semantic results and show completeness for a Hilbert-style axiomatization of this logic. There is a natural generalization to a logic for arbitrary events.

In this paper, I use a framework from computational linguistics, the Rational Speech Act framework, to model deceptive probabilistic communication. This account allows agents to discount for the biases they perceive their interlocutors to have. This way, agents can update their credences with the perceived interests of others in mind.

We propose a new model for forming and revising beliefs about unknown probabilities. To go beyond what is known with certainty and represent the agent’s beliefs about probability, we consider a plausibility map, associating to each possible distribution a plausibility ranking. Beliefs are defined as in Belief Revision Theory, in terms of truth in the most plausible worlds. We consider two forms of conditioning or belief update, corresponding to the acquisition of two types of information: learning observable evidence obtained by (...) repeated sampling from the unknown distribution; and learning higher-order information about the distribution. The first changes only the plausibility map, but leaves the given set of possible distributions essentially unchanged; the second rules out some distributions, thus shrinking the set of possibilities, without changing their plausibility ordering.. We look at stability of beliefs under either of these types of learning, defining two related notions, as well as a measure of the verisimilitude of a given plausibility model. We prove a number of convergence results, showing how our agent’s beliefs track the true probability after repeated sampling, and how she eventually gains in a sense knowledge of that true probability. Finally, we sketch the contours of a dynamic doxastic logic for statistical learning. (shrink)

This paper introduces a multi-agent dynamic epistemic logic for abstract argumentation. Its main motivation is to build a general framework for modelling the dynamics of a debate, which entails reasoning about goals, beliefs, as well as policies of communication and information update by the participants. After locating our proposal and introducing the relevant tools from abstract argumentation, we proceed to build a three-tiered logical approach. At the first level, we use the language of propositional logic to encode states of a (...) multi-agent debate. This language allows to specify which arguments any agent is aware of, as well as their subjective justification status. We then extend our language and semantics to that of epistemic logic, in order to model individuals’ beliefs about the state of the debate, which includes uncertainty about the information available to others. As a third step, we introduce a framework of dynamic epistemic logic and its semantics, which is essentially based on so-called event models with factual change. We provide completeness results for a number of systems and show how existing formalisms for argumentation dynamics and unquantified uncertainty can be reduced to their semantics. The resulting framework allows reasoning about subtle epistemic and argumentative updates—such as the effects of different levels of trust in a source—and more in general about the epistemic dimensions of strategic communication. (shrink)

The main objective of this paper is to define a logic for reasoning about distributed time-stamped claims. Such a logic is interesting for theoretical reasons, i.e. as a logic per se, but also because it has a number of practical applications, in particular when one needs to reason about a huge amount of pieces of evidence collected from different sources, where some of the pieces of evidence may be contradictory and some sources are considered to be more trustworthy than others. (...) We introduce the time-stamped claim logic including a sound and complete sequent calculus. In order to show how time-stamped claim logic can be used in practice, we consider a concrete cyber-attribution case study. (shrink)

Argument evaluation, one of the central problems in argumentation theory, consists in studying what makes an argument a good one. This paper proposes a formal approach to argument evaluation from the perspective of justification logic. We adopt a multi-agent setting, accepting the intuitive idea that arguments are always evaluated by someone. Two general restrictions are imposed on our analysis: non-deductive arguments are left out and the goal of argument evaluation is fixed: supporting a given proposition. Methodologically, our approach uses several (...) existing tools borrowed from justification logic, awareness logic, doxastic logic and logics for belief dependence. We start by introducing a basic logic for argument evaluation, where a list of argumentative and doxastic notions can be expressed. Later on, we discuss how to capture the mentioned form of argument evaluation by defining a preference operator in the object language. The intuitive picture behind this definition is that, when assessing a couple of arguments, the agent puts them to a test consisting of several criteria. As a result of this process, a preference relation among the evaluated arguments is established by the agent. After showing that this operator suffers a special form of logical omniscience, called preferential omniscience, we discuss how to define an explicit version of it, more suitable to deal with non-ideal agents. The present work exploits the formal notion of awareness in order to model several informal phenomena: awareness of sentences, availability of arguments and communication between agents and external sources. We discuss several extensions of the basic logic and offer completeness and decidability results for all of them. (shrink)

In recent work, Stalnaker proposes a logical framework in which belief is realized as a weakened form of knowledge. Building on Stalnaker’s core insights, we employ topological tools to refine and, we argue, improve on this analysis. The structure of topological subset spaces allows for a natural distinction between what is known and what is knowable; we argue that the foundational axioms of Stalnaker’s system rely intuitively on both of these notions. More precisely, we argue that the plausibility of the (...) principles Stalnaker proposes relating knowledge and belief relies on a subtle equivocation between an “evidence-in-hand” conception of knowledge and a weaker “evidence-out-there” notion of what could come to be known. Our analysis leads to a trimodal logic of knowledge, knowability, and belief interpreted in topological subset spaces in which belief is definable in terms of knowledge and knowability. We provide a sound and complete axiomatization for this logic as well as its uni-modal belief fragment. We then consider weaker logics that preserve suitable translations of Stalnaker’s postulates, yet do not allow for any reduction of belief. We propose novel topological semantics for these irreducible notions of belief, generalizing our previous semantics, and provide sound and complete axiomatizations for the corresponding logics. (shrink)

History based models suggest a process-based approach to epistemic and temporal reasoning. In this work, we introduce preferences to history based models. Motivated by game theoretical observations, we discuss how preferences can dynamically be updated in history based models. Following, we consider arrow update logic and event calculus, and give history based models for these logics. This allows us to relate dynamic logics of history based models to a broader framework.

In order to present the incidence of the dynamic turn in the logic of scientific research, we begin with a section, in this article, that deals with logical games as triggers of this dynamic turn in contemporary logic, together with the program of logical dynamics of information and interaction. We briefly introduce the main characteristics of the logic favorable to independence and the game-theoretical semantics, of dialogical logic, as well as the essential elements of this program. Although from any of (...) these points of view we have a list of logical tools to deal with more clearly epistemological issues, we highlight the role of dynamic epistemic logic, to which we dedicate the following section. There follows another one in which we enter the logical studies of abduction as one of the fundamental problems of contemporary epistemology and, in a new section, in terms of the theoretical constructs of the preceding sections, we present and explain a phenomenon that emerged in the field of linguistics, the case of the discovery of the Amazonian language pirahã, which should be considered an anomaly within the framework of the Chomskian theory. (shrink)

The paper relates evidence and justification logics, both philosophically and technically. On the philosophical side, it is suggested that the difference between the approaches to evidence in the two families of logics can be explained as a result of their focusing on two different notions of support provided by evidence. On the technical side, a justification logic with operators pertaining to both kinds of support is shown to be sound and complete with respect to a special class of awareness models. (...) In addition, a realization theorem with respect to K is shown to hold for the logic. (shrink)

The picture of information acquisition as the elimination of possibilities has proven fruitful in many domains, serving as a foundation for formal models in philosophy, linguistics, computer science, and economics. While the picture appears simple, its formalization in dynamic epistemic logic reveals subtleties: given a valid principle of information dynamics in the language of dynamic epistemic logic, substituting complex epistemic sentences for its atomic sentences may result in an invalid principle. In this article, we explore such failures of uniform substitution. (...) First, we give epistemic examples inspired by Moore, Fitch, and Williamson. Second, we answer affirmatively a question posed by van Benthem: can we effectively decide when every substitution instance of a given dynamic epistemic principle is valid? In technical terms, we prove the decidability of this schematic validity problem for public announcement logic (PAL and PAL-RC) over models for finitely many fully introspective agents, as well as models for infinitely many arbitrary agents. The proof of this result illuminates the reasons for the failure of uniform substitution. (shrink)

This paper studies Aumann’s agreeing to disagree theorem from the perspective of dynamic epistemic logic. This was first done by Dégremont and Roy (J Phil Log 41:735–764, 2012) in the qualitative framework of plausibility models. The current paper uses a probabilistic framework, and thus stays closer to Aumann’s original formulation. The paper first introduces enriched probabilistic Kripke frames and models, and various ways of updating them. This framework is then used to prove several agreement theorems, which are natural formalizations of (...) Aumann’s original result. Furthermore, a sound and complete axiomatization of a dynamic agreement logic is provided, in which one of these agreement theorems can be derived syntactically. These technical results are used to show the importance of explicitly representing the dynamics behind the agreement theorem, and lead to a clarification of some conceptual issues surrounding the agreement theorem, in particular concerning the role of common knowledge. The formalization of the agreement theorem thus constitutes a concrete example of the so-called dynamic turn in logic. (shrink)

In this paper we study substantive assumptions in social interaction. By substantive assumptions we mean contingent assumptions about what the players know and believe about each other’s choices and information. We first explain why substantive assumptions are fundamental for the analysis of games and, more generally, social interaction. Then we show that they can be compared formally, and that there exist contexts where no substantive assumptions are being made. Finally we show that the questions raised in this paper are related (...) to a number of issues concerning “large” structures in epistemic game theory. (shrink)

Rational agents base their actions on information from observation, inference, introspection, or other sources. But this information comes in different kinds, and it is usually handled by different logical mechanisms. We discuss how to integrate external ‘updating information’ and internal ‘elucidating information’ into one system of dynamic epistemic logic, by distinguishing two basic informational actions: ‘bare seeing’ versus ‘conscious realization’.

This is an essay on the understanding of disposition concepts, which exploits the Ramsey test semantics of conditionals for a refined conditional analysis of dispositions. I will show that this semantics allows for a more accurate account of disposition concepts than the standard semantics of conditionals by David Lewis. This includes dealing with the counterexamples to the conditional analysis, which are known as finks, antidotes, and mimics.

The present contribution shows that a Hilbert-style axiomatization for dynamic logic of relation changers is complete for the standard Kripke semantics not by a well-known rewriting technique but by the idea of an auxiliary semantics studied by van Benthem and Wang et al. A key insight of our auxiliary semantics for dynamic logic of relation changers can be described as: “relation changers are bounded morphisms.” Moreover, we demonstrate that this semantic insight can be used to provide a modular cut-free labelled (...) sequent calculus for the logic in the sense that our calculus can be regarded as a natural expansion of a labelled sequent calculus of iteration-free propositional dynamic logic. (shrink)

Baltag, Moss, and Solecki proposed an expansion of classical modal logic, called logic of epistemic actions and knowledge (EAK), in which one can reason about knowledge and change of knowledge. Kurz and Palmigiano showed how duality theory provides a flexible framework for modeling such epistemic changes, allowing one to develop dynamic epistemic logics on a weaker propositional basis than classical logic (for example an intuitionistic basis). In this paper we show how the techniques of Kurz and Palmigiano can be further (...) extended to define and axiomatize a bilattice logic of epistemic actions and knowledge (BEAK). Our propositional basis is a modal expansion of the well-known four-valued logic of Belnap and Dunn, which is a system designed for handling inconsistent as well as potentially conflicting information. These features, we believe, make our framework particularly promising from a computer science perspective. (shrink)

The present study focuses on a grammatical category called evidentiality. The primary meaning of evidentiality is concerned with information source. That is, it expresses whether something has been seen, heard or inferred. The aim here is to conduct a conceptual study of evidentiality in which use is made of formal tools. The fundamental intuition is that the distinction between ‘evidence’as ‘proof’and ‘evidentiality’as ‘to do with proof’is a crucial one. Evidentiality is a dynamic notion to be analysed through the use of (...) knowledge by the agents, a knowledge in action, which involves an in-coming state and an out-coming state that is typical of the transmission of information. We propose our own approach in which the dynamics of knowledge in action is grasped in the context of a dynamic epistemic logic. (shrink)

We can be hacked because there are not indiscreet questions but there are imprudent answers. The main aim of this paper is actually to learn how to create the best possible answers, the most prudent ones, in order to remain as safe as we can. That is what Hunting Hackers means: to think about what piece of information was relevant for the hacker and why that one in particular and not another. If we could preview our flaws then we would (...) be able to keep our zone safer from hackers. In order to reach this objective, we will analyse how the cryptic language known as Russian Cards operates. This study does not intend to show how the cryptic language is broken into, but to take advantage of the learning gifted in knowing the flaw itself. It is precisely in the learning of the flaw that we can find the answer to what and why we may be hacked. In proportion to the amount of flaw information at our disposal, we will be able to hunt hackers: to stop them completely or, at least, to weaken a possible hacker attack. (shrink)

From its inception in 1987 social epistemology has been divided into analytic and critical approaches, represented by Alvin I. Goldman and Steve Fuller, respectively. In this paper, the agendas and some basic ideas of ASE and CSE are compared and assessed by bringing into the discussion also other participants of the debates on the social aspects of scientific knowledge—among them Raimo Tuomela, Philip Kitcher and Helen Longino. The six topics to be analyzed include individual and collective epistemic agents; the notion (...) of scientific community; realism and constructivism; truth-seeking communities; epistemic and social values; science, experts, and democracy. (shrink)

The paper presents a new logic for reasoning about the formation of beliefs through perception or through inference in non-omniscient resource-bounded agents. The logic distinguishes the concept of explicit belief from the concept of background knowledge. This distinction is reflected in its formal semantics and axiomatics: we use a non-standard semantics putting together a neighborhood semantics for explicit beliefs and relational semantics for background knowledge, and we have specific axioms in the logic highlighting the relationship between the two concepts. Mental (...) operations of perceptive type and inferential type, having effects on epistemic states of agents, are primitives in the object language of the logic. At the semantic level, they are modelled as special kinds of model-update operations, in the style of dynamic epistemic logic. Results about axiomatization, decidability and complexity for the logic are given in the paper. (shrink)

Dynamic Epistemic Logic (DEL) is the study of how to reason about knowledge, belief, and communication. This paper studies the relative expressivity of certain fragments of the DEL language for public and private communication. It is shown that the language of public communication with common knowledge and the language of private communication with common knowledge are expressively incomparable for the class of all pointed Kripke models, which provides a formal proof that public and private communication are fundamentally different in the (...) presence of common knowledge. It is also shown that single-recipient private communication does not add expressive power to the language of modal logic with common knowledge for any class of transitive pointed Kripke models. The latter result provides a sense in which positive introspection—believing our own beliefs—induces a kind of self-dialog. (shrink)