## The logic of public announcements, common knowledge, and private suspicions (1999)

Citations: | 237 - 4 self |

### BibTeX

@TECHREPORT{Baltag99thelogic,

author = {Alexandru Baltag and Lawrence S. Moss and Slawomir Solecki},

title = {The logic of public announcements, common knowledge, and private suspicions},

institution = {},

year = {1999}

}

### Years of Citing Articles

### OpenURL

### Abstract

### Citations

1496 |
M.: Reasoning about Knowledge
- Fagin, Halpern, et al.
- 1995
(Show Context)
Citation Context ...ouncements with suspicious outsiders, etc. In our system, such actions correspond to additional modalities in the object language. That is, we do not add machinery on top of models (as in Fagin et al =-=[4]-=-), but we reify aspects of the machinery in the logical language. Special cases of our logic have been considered in Plaza [13], Gerbrandy [5, 6], and Gerbrandy and Groeneveld [7]. The latter group of... |

265 | Orderings for term rewriting systems
- DERSHOWITZ
- 1982
(Show Context)
Citation Context ... relation < on the function symbols. We set app to be greater than all other function symbols. In all other cases, distinct function symbols are unordered. Theorem 8.1 (Kamin and Levy [9]; Dershowitz =-=[3]-=-) Let < be an LPO on Σ-terms. 1. < is transitive. 2. < has the subterm property: iftis a proper subterm of u,thent<u. 3. < is monotonic (it has the replacement property): if y<xi for some i,then 4. < ... |

217 | Defaults in update semantics
- Veltman
- 1996
(Show Context)
Citation Context ...pistemic logics with group updates initiated in Gerbrandy and Groeneveld [3]. The idea is to meld the approaches of multi-agent epistemic logic as appears in Fagin et al [1]) with the work of Veltman =-=[5]-=- on update semantics. Veltman's goal is to give a "dynamic" account of meaning which replaces truth-conditional semantics by notions having to do with changes of information state. An example of an an... |

164 | Bisimulations on Planet Kripke - Gerbrandy - 1999 |

146 |
Logics of public communications
- Plaza
- 1989
(Show Context)
Citation Context ...age. That is, we do not add machinery on top of models (as in Fagin et al [4]), but we reify aspects of the machinery in the logical language. Special cases of our logic have been considered in Plaza =-=[13]-=-, Gerbrandy [5, 6], and Gerbrandy and Groeneveld [7]. The latter group of papers introduce a language in which one can faithfully represent all of the reasoning in examples such as the Muddy Children ... |

145 | The complexity of reasoning about knowledge and time - Halpern, Vardi - 1986 |

95 | Reasoning about information change
- Gerbrandy, Groeneveld
- 1997
(Show Context)
Citation Context ...s (as in Fagin et al [4]), but we reify aspects of the machinery in the logical language. Special cases of our logic have been considered in Plaza [13], Gerbrandy [5, 6], and Gerbrandy and Groeneveld =-=[7]-=-. The latter group of papers introduce a language in which one can faithfully represent all of the reasoning in examples such as the Muddy Children scenario. In that paper we find operators for updati... |

48 |
Two generalizations of the recursive path ordering. Unpublished
- Kamin, Levy
- 1980
(Show Context)
Citation Context ...ix a wellfounded relation < on the function symbols. We set app to be greater than all other function symbols. In all other cases, distinct function symbols are unordered. Theorem 8.1 (Kamin and Levy =-=[9]-=-; Dershowitz [3]) Let < be an LPO on Σ-terms. 1. < is transitive. 2. < has the subterm property: iftis a proper subterm of u,thent<u. 3. < is monotonic (it has the replacement property): if y<xi for s... |

36 | Dynamic Epistemic Logic
- Gerbrandy
- 1999
(Show Context)
Citation Context ... do not add machinery on top of models (as in Fagin et al [4]), but we reify aspects of the machinery in the logical language. Special cases of our logic have been considered in Plaza [13], Gerbrandy =-=[5, 6]-=-, and Gerbrandy and Groeneveld [7]. The latter group of papers introduce a language in which one can faithfully represent all of the reasoning in examples such as the Muddy Children scenario. In that ... |

16 |
An elementary proof of the completeness
- Kozen, Parikh
- 1981
(Show Context)
Citation Context ... i, ⊢ ϕi ↔ ϕ ′ i . ⊣s5. Completeness for L([α],✷ ∗ ) 21 5.2 Completeness The proof of completeness and decidability is based on the filtration argument for completeness of PDL due to Kozen and Parikh =-=[10]-=-. We show that every consistent ϕ has a finite model, and that the size of the model is recursive in ϕ. We shall need to use some results concerning the rewriting system R ∗ from Section 4. Definition... |

5 | Proof-theoretic analysis of termination proofs. Annals of Pure and Applied Logic 75
- Buchholz
- 1995
(Show Context)
Citation Context ... since the latter implies that any replacement according to the rewrite system results in a smaller term in the order <. Here is a proof of of the wellfoundedness property (4), taken from on Buchholz =-=[2]-=-. (We generalized it slightly from the one-sorted to the many-sorted setting and from the assumption that < is a finite linear order on Σ to the assumption that < is any wellfounded order.) Let W be t... |

3 |
From hypersets to Kripke models in logics of announcements
- Moss
- 1999
(Show Context)
Citation Context ...know about non-wellfounded sets, and also that completeness results are slightly stronger with a more general semantics. The relevant equivalence of the two semantics is the subject of the short note =-=[11]-=-. The following are the new contributions of this paper: 1. We formulated a logical system with modalities corresponding to intuitive group-level epistemic actions. These actions include natural forma... |

2 |
Termination orderings
- Plaisted
(Show Context)
Citation Context ...kes tuples in W n to elements of W, it follows by induction on terms that all terms belong to W. ⊣ For more on the LPO, its generalizations and extensions, see the surveys Dershowitz [3] and Plaisted =-=[12]-=-. Proposition 8.2 Consider the LPO < on L([α], ✷∗ ) defined above. 1. If α → ∗ β,thenpre(β) <α. 2. If α → ∗ β,then[β]ψ<[α]✷ ∗ C ψ. 3. pre(α) → p<[α]p. 4. pre(α) →¬[α]ψ<[α]¬ψ. 5. [α]ψ ∧ [α]χ<[α](ψ ∧ χ)... |

1 |
A logic of epistemic actions, ms
- Baltag
- 1999
(Show Context)
Citation Context ...e considering modal logic with the restriction that at any world satisfies exactly one atomic sentence.) Taking this other option thus brings actions and models closer. This idea is pursued in Baltag =-=[1]-=-, a continuation of this work which develops a “calculus of epistemic actions.” This replaces the “semantic” actions of this paper with action expressions. These expressions have nicer properties than... |