Synthese 191 (14):3407-3426 (2014)

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
Keywords Common knowledge  Hypergraph  Axiomatization  Completeness
Categories (categorize this paper)
DOI 10.1007/s11229-014-0455-9
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 57,041
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Logic of Secrets in Collaboration Networks.Sara More & Pavel Naumov - 2011 - Annals of Pure and Applied Logic 162 (12):959-969.
Logic of Secrets in Collaboration Networks.Sara Miner More & Pavel Naumov - 2011 - Annals of Pure and Applied Logic 162 (12):959-969.
Fault Tolerance in Belief Formation Networks.Sarah Holbrook & Pavel Naumov - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 267--280.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles


Added to PP index

Total views
19 ( #537,498 of 2,410,766 )

Recent downloads (6 months)
1 ( #538,938 of 2,410,766 )

How can I increase my downloads?


My notes