We show the faithful embedding of common knowledge logic CKL into game logic GL, that is, CKL is embedded into GL and GL is a conservative extension of the fragment obtained by this embedding. Then many results in GL are available in CKL, and vice versa. For example, an epistemic consideration of Nash equilibrium for a game with pure strategies in GL is carried over to CKL. Another important application is to obtain a Gentzen-style sequent calculus (...) formulation of CKL and its cut-elimination. The faithful embedding theorem is proved for the KD4-type propositional CKL and GL, but it holds for some variants of them. (shrink)

In terms of formal deductive systems and multi-dimensional Kripke frames we study logical operations know, informed, common knowledge and common information. Based on [6] we introduce formal axiomatic systems for common information logics and prove that these systems are sound and complete. Analyzing the common information operation we show that it can be understood as greatest open fixed points for knowledge formulas. Using obtained results we explore monotonicity, omniscience problem, and inward monotonocity, describe their (...) connections and give dividing examples. Also we find algorithms recognizing these properties for some particular cases. (shrink)

In this paper we investigate first order common knowledge logics; i.e., modal epistemic logics based on first order logic with common knowledge operators. It is shown that even rather weak fragments of first order common knowledge logics are not recursively axiomatizable. This applies, for example, to fragments which allow to reason about names only; that is to say, fragments the first order part of which is based on constant symbols and the equality symbol (...) only. Then formal properties of "quantifying into" epistemic contexts are investigated. The results are illustrated by means of epistemic representations of Nash Equilibria for finite games with mixed strategies. (shrink)

In order to capture the concept of common knowledge, various extensions of multi-modal epistemic logics, such as fixed-point ones and infinitary ones, have been proposed. Although we have now a good list of such proposed extensions, the relationships among them are still unclear. The purpose of this paper is to draw a map showing the relationships among them. In the propositional case, these extensions turn out to be all Kripke complete and can be comparable in a meaningful manner. (...) F. Wolter showed that the predicate extension of the Halpern-Moses fixed-point type common knowledge logic is Kripke incomplete. However, if we go further to an infinitary extension, Kripke completeness would be recovered. Thus there is some gap in the predicate case. In drawing the map, we focus on what is happening around the gap in the predicate case. The map enables us to better understand the common knowledge logics as a whole. (shrink)

The First International Workshop brings together researchers from the theoretical ends of the logic programming and artificial intelligence communities to discuss their mutual interests. Logic programming deals with the use of models of mathematical logic as a way of programming computers, where theoretical AI deals with abstract issues in modeling and representing human knowledge and beliefs. One common ground is nonmonotonic reasoning, a family of logics that includes room for the kinds of variations that can (...) be found in human reasoning. Topics covered: Stable Semantics. Default Logic. AutoEpistemic Logic. Truth Maintenance Systems. Implementation Issues. Diagnosis. Applications. Inheritance Reasoning. Logics of Belief. Inconsistency and Non-Monotonicity. (shrink)

Current dynamic epistemic logics often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions regarding common knowledge express the essence of what communication achieves. We present some methods that yield so-called reduction axioms for common knowledge. We investigate the expressive power of public announcement logic with relativized common knowledge, and present reduction axioms that give a detailed account of the dynamics of common knowledge (...) in some major communication types. (shrink)

Current dynamic epistemic logics often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions regarding common knowledge express the essence of what communication achieves. We present some methods that yield so-called reduction axioms for common knowledge. We investigate the expressive power of public announcement logic with relativized common knowledge, and present reduction axioms that give a detailed account of the dynamics of common knowledge (...) in some major communication types. (shrink)

Two approaches for defining common knowledge coexist in the literature: the infinite iteration definition and the circular or fixed point one. In particular, an original modelization of the fixed point definition was proposed by Barwise in the context of a non-well-founded set theory and the infinite iteration approach has been technically analyzed within multi-modal epistemic logic using neighbourhood semantics by Lismont. This paper exhibits a relation between these two ways of modelling common knowledge which seem (...) at first quite different. (shrink)

One of the fundamental theses of this book is that logical consequence and logical truth are not simply given, but arise as conventions among the users of logic. Thus Syverson explains convention within a game-theoretic framework, as a kind of equilibrium between the strategies of players in a game where they share common knowledge of events—a revisiting of Lewis's Convention that argues that convention can be reasonably treated as coordination equilibria. Most strikingly, a realistic solution is provided (...) for Gray's classic coordination problem, wherein two generals can only communicate with each other through unreliable means. (shrink)

This work introduces a two-dimensional modal logic to represent agents' Concurrent Common Knowledge in distributed systems. Unlike Common Knowledge, Concurrent Common Knowledge is a kind of agreement reachable in asynchronous environments. The formalization of such type of knowledge is based on a model for asynchronous systems and on the definition of Concurrent Knowledge introduced before in paper [5]. As a proper semantics, we review our concept of closed sub-product of modal logics (...) which is based on the product of modal logics. The key idea is to reason about Concurrent Knowledge under a two-dimensional approach, regarding asynchronous runs and consistent global states as dimensions. We present an axiomatic system for the logic and issue the corresponding soundness and completeness proofs. (shrink)

This paper investigates the epistemic assumptions that David Lewis makes in his account of social conventions. In particular, I focus on the assumption that the agents have common knowledge of the convention to which they are parties. While evolutionary analyses show that the common knowledge assumption is unnecessary in certain classes of games, Lewis’ original account (and, more recently, Cubitt and Sugden’s reconstruction) stresses the importance of including it in the definition of convention. I discuss arguments (...) pro et contra to argue that, although the assumption might be relevant to a descriptively adequate account of social convention, it is not required for its rational reconstruction. I then point out that Lewis’ account, properly speaking, is of common reason to believe, rather than of common knowledge, and argue that, in order to formalize aptly the distinction between reason to believe and belief, standard formal epistemic models need to be supplemented with so-called awareness structures. Finally, I stress that the notion of knowledge implicit in Lewis’ text involves interesting elements that cannot be captured in the standard propositional formalizations, but need the full expressive force of quantified epistemic logic. (shrink)

The paper surveys the currently available axiomatizations of common belief (CB) and common knowledge (CK) by means of modal propositional logics. (Throughout, knowledge- whether individual or common- is defined as true belief.) Section 1 introduces the formal method of axiomatization followed by epistemic logicians, especially the syntax-semantics distinction, and the notion of a soundness and completeness theorem. Section 2 explains the syntactical concepts, while briefly discussing their motivations. Two standard semantic constructions, Kripke structures and neighbourhood (...) structures, are introduced in Sections 3 and 4, respectively. It is recalled that Aumann's partitional model of CK is a particular case of a definition in terms of Kripke structures. The paper also restates the well-known fact that Kripke structures can be regarded as particular cases of neighbourhood structures. Section 3 reviews the soundness and completeness theorems proved w.r.t. the former structures by Fagin, Halpern, Moses and Vardi, as well as related results by Lismont. Section 4 reviews the corresponding theorems derived w.r.t. the latter structures by Lismont and Mongin. A general conclusion of the paper is that the axiomatization of CB does not require as strong systems of individual belief as was originally thought- only monotonicity has thusfar proved indispensable. Section 5 explains another consequence of general relevance: despite the "infinitary" nature of CB, the axiom systems of this paper admit of effective decision procedures, i.e., they are decidable in the logician's sense. (shrink)

Using epistemic logic, we provide a non-probabilistic way to formalise payoff uncertainty, that is, statements such as ‘player i has approximate knowledge about the utility functions of player j.’ We show that on the basis of this formalisation common knowledge of payoff uncertainty and rationality (in the sense of excluding weakly dominated strategies, due to Dekel and Fudenberg (1990)) characterises a new solution concept we have called ‘mixed iterated strict weak dominance.’.

For as long as there have been theories about common knowledge, they have been exposed to a certain amount of skepticism. Recent more sophisticated arguments question whether agents can acquire common attitudes and whether they are needed in social reasoning. I argue that this skepticism arises from assumptions about practical reasoning that, considered in themselves, are at worst implausible and at best controversial. A proper approach to the acquisition of attitudes and their deployment in decision making leaves (...) room for common attitudes. Postulating them is no worse off than similar idealizations that are usefully made in logic and economics. (shrink)

We develop a logical system that captures two different interpretations of what extensive games model, and we apply this to a long-standing debate in game theory between those who defend the claim that common knowledge of rationality leads to backward induction or subgame perfect (Nash) equilibria and those who reject this claim. We show that a defense of the claim à la Aumann (1995) rests on a conception of extensive game playing as a one-shot event in combination with (...) a principle of rationality that is incompatible with it, while a rejection of the claim à la Reny (1988) assumes a temporally extended, many-moment interpretation of extensive games in combination with implausible belief revision policies. In addition, the logical system provides an original inductive and implicit axiomatization of rationality in extensive games based on relations of dominance rather than the usual direct axiomatization of rationality as maximization of expected utility. (shrink)

The importance of the notion of common knowledge in sustaining cooperative outcomes in strategic situations is well appreciated. However, the systematic analysis of the extent to which small departures from common knowledge affect equilibrium in games has only recently been attempted.We review the main themes in this literature, in particular, the notion of common p-belief. We outline both the analytical issues raised, and the potential applicability of such ideas to game theory, computer science and the (...) philosophy of language. (shrink)

David Lewis is widely regarded as the philosopher who introduced the concept of common knowledge. His account of common knowledge differs greatly from most later accounts in philosophy and economy, with the central notion of his theory being ‘having reason to believe’ rather than ‘knowledge’. Unfortunately, Lewis’s account is rather informal, and the argument has a few gaps. This paper assesses two major attempts to formalise Lewis’s account and argues that these formalisations are missing a (...) crucial aspect of this account. Therefore, a new reconstruction is proposed, which explicitly discusses ‘reasons’ and uses a logic inspired by justification logic. (shrink)

For thirty years at least, I have designated myself as a zoologist interested in the “philosophical aspects of biology”. But I have now to admit that not until within the last two or three years have I recognized that logic, particularly in its inductive aspect, is involved in such interest.For me as a zoologist with a predilection for natural history, observation has had a place of wide application and of implicit confidence. Until recently, I had rested in the supposition (...) that after all of the devices practiced by naturalists to insure certainty of their observations, nothing further was needed so far as the information and understanding they gained was concerned. I had gone ahead with my reasoning, my logic, with no more qualms about the trustworthiness of the “inductive” than of the “deductive” side of it. I had not taken seriously the assertion, made years ago in my hearing by an eminent philosopher, that no one can be a philosopher without being skeptical and critical of the use of his senses in getting knowledge. Latterly, however, I have come to see that traditional philosophers take themselves very seriously in such assertions. This realization has been due to the discovery that the recent advances in physics and mathematics have led most of the leaders in these fields to believe that observation and the inductive side of logic may be left where they were a hundred years ago. These scientists seem to be about where John Stuart Mill was in his effort to improve Lord Bacon's effort for a better understanding of both observation and induction. (shrink)

Using epistemic logic, we provide a non-probabilistic way to formalise payoff uncertainty, that is, statements such as ‘player i has approximate knowledge about the utility functions of player j.’ We show that on the basis of this formalisation common knowledge of payoff uncertainty and rationality (in the sense of excluding weakly dominated strategies, due to Dekel and Fudenberg (1990)) characterises a new solution concept we have called ‘mixed iterated strict weak dominance.’.

In lieu of an abstract, here is a brief excerpt of the content:Philosophy and Rhetoric 34.2 (2001) 93-112 [Access article in PDF] Enthymemes, Common Knowledge, and Plausible Inference Douglas Walton The study of enthymemes has always been regarded as important in logic, critical thinking, and rhetoric, but too often it is the formal or mechanistic aspect of it that has been in the forefront. This investigation will show that there is a kind of plausibilistic script-based reasoning, of (...) a kind that has mainly been studied in artificial intelligence, that should have a much more important role to play in the study of enthymemes. But then curiously, as will also be shown, this plausibilistic type of reasoning was familiar in the ancient world, to the Sophists, as well as to leading philosophers such as Plato and Aristotle. By linking this ancient notion of plausibility to the modern notion used in computer science, this investigation reveals an important basis for the enthymeme that has a type of logical structure in its own right, but also has an informal aspect.An enthymeme, in current usage, is an argument that has one or more premises, or possibly a conclusion, not explicitly stated in the text, but that needs to have these propositions explicitly stated to extract the complete argument from the text. Sometimes enthymemes are described as arguments with "missing premises." That vocabulary is awkward, however, because the nonexplicit statement that needs to be added can be a conclusion, at least in a minority of cases. To make the exposition below smoother, the term nonexplicit assumption will be used to cover either the case of a nonexplicit premise or that of a nonexplicit conclusion. The problem with enthymemes is that if the nonexplicit assumptions in an argument are supposed to be propositions used by the arguer (as opposed to just the propositions needed to make the argument structurally correct, according to some standard), reasonable people can have differences of opinion on what the nonexplicit assumptions are supposed to be. The problem is that filling in the missing parts of enthymemes depends on interpreting the natural language [End Page 93] in which the argument was put forward to try to determine what the speaker meant to say.The solution to the problem comes through the recognition that enthymemes rest not only on formal (structural) criteria, but also on informal criteria. One of the most important of these informal criteria is something often called "common knowledge" (Govier 1992; Freeman 1995). But as shown below in a set of selected case studies of enthymemes, "common knowledge" is not really a kind of knowledge at all. It is really plausibility, or eikos, something well known in the ancient world and often misleadingly translated as "probability." Curiously, Aristotle's original doctrine of the enthymeme was based on this notion of plausibility. This historical fact has often been a source of puzzlement and confusion, and sometimes it has even been taken to indicate a defect or contradiction in Aristotle's treatment of the enthymeme. However, the goal of this investigation is not primarily historical. It is to work out one of the most important required steps toward a solution to the problem of enthymemes. But to do this, it is necessary to come back to the ancient notion of plausible inference. 1. The problem with enthymemes Once you have any formal theory of inference, like syllogistic, for example, you will be confronted by cases of arguments in everyday discourse that meet all the requirements for a structurally correct inference except that some part or parts, usually a premise or a conclusion, is missing. By "missing" is meant that the proposition in question has not been explicitly stated in the text of discourse, even though it may be clear enough that the speaker (writer) was relying on it, or including it, as part of the argument. The classic example is the following inference: All men are mortal; therefore, Socrates is mortal. To evaluate such an argument, surely some account of the "hidden" or "missing" assumption needs to be taken. The problem with enthymemes (Burke 1985; Gough and Tindale 1985; Hitchcock 1985) is that, if given carte... (shrink)

We present a cut-free tableau calculus with histories and variables for the EXPTIME-complete multi-modal logic of common knowledge. Our calculus constructs the tableau using only one pass, so proof-search for testing theoremhood of ϕ does not exhibit the worst-case EXPTIME-behaviour for all ϕ as in two-pass methods. Our calculus also does not contain a “finitized ω-rule” so that it detects cyclic branches as soon as they arise rather than by worst-case exponential branching with respect to the size (...) of ϕ. Moreover, by retaining the rooted-tree form from traditional tableaux, our calculus becomes amenable to the vast array of optimisation techniques which have proved essential for “practical” automated reasoning in very expressive description logics. Our calculus forms the basis for developing a uniform framework for the family of all fix-point logics of common knowledge. However, there is still no “free lunch” as, in the worst case, our method exhibits 2EXPTIME-behaviour. A prototype implementation can be found at twb.rsise.anu.edu.au which allows users to test formulae via a simple graphical interface. (shrink)

We sketch recent insights in dynamic epistemic logic and use them to shed new light on old ideas about common knowledge as a prerequisite for linguistic communication.

The notions of common knowledge or common belief play an important role in several areas of computer science , in philosophy, game theory, artificial intelligence, psychology and many other fields which deal with the interaction within a group of “agents”, agreement or coordinated actions. In the following we will present several deductive systems for common knowledge above epistemic logics –such as K, T, S4 and S5 –with a fixed number of agents. We focus on structural (...) and proof-theoretic properties of these calculi. (shrink)

In this paper we present a finitary sequent calculus for the S5 multi-modal system with common knowledge. The sequent calculus is based on indexed hypersequents which are standard hypersequents refined with indices that serve to show the multi-agent feature of the system S5. The calculus has a non-analytic right introduction rule. We prove that the calculus is contraction- and weakening-free, that (almost all) its logical rules are invertible, and finally that it enjoys a syntactic cut-elimination procedure. Moreover, the (...) use of the non-analytic rule can be restricted so that the calculus can be considered as suitable for proof search. (shrink)

The importance of the notion of common knowledge in sustaining cooperative outcomes in strategic situations is well appreciated. However, the systematic analysis of the extent to which small departures from common knowledge affect equilibrium in games has only recently been attempted.We review the main themes in this literature, in particular, the notion of common p-belief. We outline both the analytical issues raised, and the potential applicability of such ideas to game theory, computer science and the (...) philosophy of language. (shrink)

Contemporary epistemology has explored the notion of a hinge commitment as set out in Wittgenstein’s final notebooks, published as On Certainty. These are usually understood as essentially groundless certainties that provide the necessary framework within which rational evaluations can take place. John Greco has recently offered a striking account of hinge commitments as a distinctive kind of knowledge that he calls ‘common knowledge’. According to Greco, this is knowledge that members of the community get to have (...) without incurring any epistemic burden, and as such is fundamentally different from other kinds of knowledge. I offer a critique of Greco’s proposal. While I agree that there is a variety of knowledge that counts as common knowledge, I contend that it is not to be understood as knowledge that one gets for free as Greco suggests. Moreover, I argue that our hinge commitments do not count as common knowledge—either in Greco’s sense of the term or in the alternative manner that I set out—because properly understood they are not in the market for knowledge at all. In defence of this claim, I suggest that Greco’s conception of a hinge commitment is both missing some crucial elements and also too broad in its extension, in that it encompasses both instances of common knowledge and hinge commitments proper. (shrink)

Common knowledge of a proposition A can be characterized by the following infinitary conjunction: everybody knows A and everybody knows that everybody knows A and everybody knows that everybody knows that everybody knows A and so on. We present a survey of deductive systems for the logic of common knowledge. In particular, we present two different Hilbert-style axiomatizations and two infinitary cut-free sequent systems. Further we discuss the problem of syntactic cut-elimination for common (...) class='Hi'>knowledge. The paper concludes with a list of open problems. (shrink)

Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge. We define a Kripke-style semantics that is similar to Fitting's semantics for the Logic of Proofs LP. We show the soundness, completeness, and finite model property of our multi-agent justification logic with respect to this Kripke-style semantics. We demonstrate that our logic is (...) a conservative extension of Yavorskaya's minimal bimodal explicit evidence logic, which is a two-agent version of LP. We discuss the relationship of our logic to the multi-agent modal logic S4 with common knowledge. Finally, we give a brief analysis of the coordinated attack problem in the newly developed language of our logic. (shrink)

For the modal logic |$\textsf {S4}^{C}_{I}$|⁠, we identify the class of completable |$\textsf {S4}^{C}_{I}$|-algebras and prove for them a Stone-type representation theorem. As a consequence, we obtain strong algebraic and topological completeness of the logic |$\textsf {S4}^{C}_{I}$| in the case of local semantic consequence relations. In addition, we consider an extension of the logic |$\textsf {S4}^{C}_{I}$| with certain infinitary derivations and establish the corresponding strong completeness results for the enriched system in the case of global semantic consequence (...) relations. (shrink)

We first look at an existing infinitary sequent system for common knowledge for which there is no known syntactic cut-elimination procedure and also no known non-trivial bound on the proof-depth. We then present another infinitary sequent system based on nested sequents that are essentially trees and with inference rules that apply deeply inside these trees. Thus we call this system “deep” while we call the former system “shallow”. In contrast to the shallow system, the deep system allows one (...) to give a straightforward syntactic cut-elimination procedure. Since both systems can be embedded into each other, this also yields a syntactic cut-elimination procedure for the shallow system. For both systems we thus obtain an upper bound of φ20 on the depth of proofs, where φ is the Veblen function. (shrink)

The article studies common knowledge in communication networks with a fixed topological structure. It introduces a non-trivial principle, called the Ryōan-ji axiom, which captures logical properties of common knowledge of all protocols with a given network topology. A logical system, consisting of the Ryōan-ji axiom and two additional axioms, is proven to be sound and complete.

The paper presents a variation of the EMAIL Game, originally proposed byRubinstein (American Economic Review, 1989), in which coordination ofthe more rewarding-risky joint course of actions is shown to obtain, evenwhen the relevant game is, at most, ``mutual knowledge.'' In the exampleproposed, a mediator is introduced in such a way that two individualsare symmetrically informed, rather than asymmetrically as in Rubinstein,about the game chosen by nature. As long as the message failure probabilityis sufficiently low, with the upper bound being (...) a function of the gamepayoffs, conditional beliefs in the opponent's actions can allow playersto choose a more rewarding-risky action. The result suggests that, forefficient coordination to obtain, the length of interactive knowledge onthe game, possibly up to ``almost common knowledge,'' does not seem to bea major conceptual issue and that emphasis should be focused instead onthe communication protocol and an appropriate relationship between thereliability of communication channels and the payoffs at stake. (shrink)

Antoine Arnauld and Pierre Nicole were philosophers and theologians associated with Port-Royal Abbey, a centre of the Catholic Jansenist movement in seventeenth-century France. Their enormously influential Logic or the Art of Thinking, which went through five editions in their lifetimes, treats topics in logic, language, theory of knowledge and metaphysics, and also articulates the response of 'heretical' Jansenist Catholicism to orthodox Catholic and Protestant views on grace, free will and the sacraments. In attempting to combine the categorical (...) theory of the proposition with a Cartesian account of knowledge, their Logic represents the classical view of judgment which inspired the modern transformation in logic and semantic theory by Frege, Russell, Wittgenstein and recent philosophers. This edition presents a new translation of the text, together with a historical introduction and suggestions for further reading. (shrink)

Branching-time temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic CTL, which has made it possible to implement tools that allow designers to automatically verify that systems satisfy requirements expressed in CTL. Recently, CTL was generalised by Alur, Henzinger, and Kupferman in a logic known as Alternating-time Temporal Logic (ATL). (...) The key insight in ATL is that the path quantifiers of CTL could be replaced by cooperation modalities, of the form , where is a set of agents. The intended interpretation of an ATL formula is that the agents can cooperate to ensure that holds (equivalently, that have a winning strategy for ). In this paper, we extend ATL with knowledge modalities, of the kind made popular in the work of Fagin, Halpern, Moses, Vardi and colleagues. Combining these knowledge modalities with ATL, it becomes possible to express such properties as group can cooperate to bring about iff it is common knowledge in that . The resulting logic — Alternating-time Temporal Epistemic Logic (ATEL) — shares the tractability of model checking with its ATL parent, and is a succinct and expressive language for reasoning about game-like multiagent systems. (shrink)

This is the sequel to Logic. A disciplined mind is one of the most conspicuously missing things in our society. This book can help alleviate that malady. The subtitle of this book is, "Communication of useful knowledge in religion, in the sciences, and in common life." This is a lithograph of an 1833 edition printed in London which also contains "A Discourse on the Education of Children and Youth.".

Branching-time temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic CTL, which has made it possible to implement tools that allow designers to automatically verify that systems satisfy requirements expressed in CTL. Recently, CTL was generalised by Alur, Henzinger, and Kupferman in a logic known as "Alternating-time Temporal Logic". The (...) key insight in ATL is that the path quantifiers of CTL could be replaced by "cooperation modalities", of the form $\langle \langle \Gamma \rangle \rangle $, where Γ is a set of agents. The intended interpretation of an ATL formula $\langle \langle \Gamma \rangle \rangle \varphi $ is that the agents Γ can cooperate to ensure that φ holds. In this paper, we extend ATL with knowledge modalities, of the kind made popular in the work of Fagin, Halpern, Moses, Vardi and colleagues. Combining these knowledge modalities with ATL, it becomes possible to express such properties as "group Γ can cooperate to bring about φ iff it is common knowledge in Γ that ψ". The resulting logic -- Alternating-time Temporal Epistemic Logic -- shares the tractability of model checking with its ATL parent, and is a succinct and expressive language for reasoning about game-like multiagent systems. (shrink)

While dynamic epistemic logics with common knowledge have been extensively studied, dynamic epistemic logics with distributed knowledge have so far received far less attention. In this paper we study extensions of public announcement logic ( $\mathcal{PAL }$ ) with distributed knowledge, in particular their expressivity, axiomatisations and complexity. $\mathcal{PAL }$ extended only with distributed knowledge is not more expressive than standard epistemic logic with distributed knowledge. Our focus is therefore on $\mathcal{PACD }$ (...) , the result of adding both common and distributed knowledge to $\mathcal{PAL }$ , which is more expressive than each of its component logics. We introduce an axiomatisation of $\mathcal{PACD }$ , which is not surprising: it is the combination of well-known axioms. The completeness proof, however, is not trivial, and requires novel combinations and extensions of techniques for dealing with $S5$ knowledge, distributed knowledge, common knowledge and public announcements at the same time. We furthermore show that $\mathcal{PACD }$ is decidable, more precisely that it is $\textsc {exptime}$ -complete. This result also carries over to $\mathcal{S 5\mathcal CD }$ with common and distributed knowledge operators for all coalitions (and not only the grand coalition). Finally, we propose a notion of a trans-bisimulation to generalise certain results and give deeper insight into the proofs. (shrink)