Article ID: | iaor20002289 |
Country: | Germany |
Volume: | 28 |
Issue: | 3 |
Start Page Number: | 367 |
End Page Number: | 384 |
Publication Date: | Jan 1999 |
Journal: | International Journal of Game Theory |
Authors: | Simon R.S. |
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 coresponding to a set of formulas held in common knowledge has radical implications for its topological and combinatorial structure.