The difference between common knowledge of formulas and sets (original) (raw)
Abstract.
Common knowledge can be defined in at least two ways: syntactically as the common knowledge of a set of formulas or semantically, as the meet of the knowledge partitions of the agents. In the multi-agent S5 logic with either finitely or countably many agents and primitive propositions, the semantic definition is the finer one. For every subset of formulas that can be held in common knowledge, there is either only one member or uncountably many members of the meet partition with this subset of formulas held in common knowledge. If there are at least two agents, there are uncountably many members of the meet partition where only the tautologies of the multi-agent S5 logic are held in common knowledge. Whether or not a member of the meet partition is the only one corresponding to a set of formulas held in common knowledge has radical implications for its topological and combinatorial structure.
Access this article
Subscribe and save
- Starting from 10 chapters or articles per month
- Access and download chapters and articles from more than 300k books and 2,500 journals
- Cancel anytime View plans
Buy Now
Price excludes VAT (USA)
Tax calculation will be finalised during checkout.
Instant access to the full article PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
- Institute for Mathematical Stochastics, Lotzestr. 13, D-37083 Göttingen, Germany (e-mail: simon@math.uni-goettingen.de), , , , , , DE
Robert Samuel Simon
Authors
- Robert Samuel Simon
Rights and permissions
About this article
Cite this article
Simon, R. The difference between common knowledge of formulas and sets.Game Theory 28, 367–384 (1999). https://doi.org/10.1007/s001820050115
- Issue date: August 1999
- DOI: https://doi.org/10.1007/s001820050115