Synthese

, Volume 191, Issue 14, pp 3407–3426 | Cite as

The Ryōan-ji axiom for common knowledge on hypergraphs

Article
First Online:
Received:
Accepted:

Abstract

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 
This is a preview of subscription content, log in to check access.

References

  1. Berge, C. (1989). Hypergraphs, North-Holland Mathematical Library, Vol. 45. North-Holland Publishing Co., Amsterdam. (Combinatorics of finite sets, Translated from the French).Google Scholar
  2. Donders, M. S., More, S. M., & Naumov, P. (2011). Information flow on directed acyclic graphs. In L. D. Beklemishev & R. de Queiroz (Eds.) WoLLIC. Lecture Notes in Computer Science, vol. 6642 (pp. 95–109). SpringerGoogle Scholar
  3. Fagin, R., Halpern, J. Y., Moses, Y., & Vardi, M. Y. (1995). Reasoning about knowledge. Cambridge, MA: MIT Press.Google Scholar
  4. Halpern, J. Y., & Moses, Y. (1990). Knowledge and common knowledge in a distributed environment. Journal of ACM, 37(3), 549–587.Google Scholar
  5. Holbrook, S., & Naumov, P. (2012). Fault tolerance in belief formation networks. In: L. F. del Cerro, A. Herzig & J. Mengin (Eds.) JELIA, Lecture Notes in Computer Science, vol. 7519 (pp. 267–280). SpringerGoogle Scholar
  6. Kane, J., & Naumov, P. (2013). Epistemic logic for communication chains. In 14th Conference on Theoretical Aspects of Rationality and Knowledge (TARK ‘13), January 2013 (pp. 131–137), Chennai, India.Google Scholar
  7. Lewis, D. (1969). Convention: A philosophical study. Cambridge, MA: Harvard University Press.Google Scholar
  8. More, S. M., & Naumov, P. (2011a). The functional dependence relation on hypergraphs of secrets. In: J. Leite, P. Torroni, T. Ågotnes, G. Boella, & L. van der Torre (Eds.), CLIMA, Lecture Notes in Computer Science, Vol. 6814 (pp. 29–40). SpringerGoogle Scholar
  9. More, S. M., & Naumov, P. (2011b). Hypergraphs of multiparty secrets. Annals of Mathematics and Artificial Intelligence, 62(1–2), 79–101.CrossRefGoogle Scholar
  10. More, S. M., & Naumov, P. (2011c). Logic of secrets in collaboration networks. The Annals of Pure and Applied Logic, 162(12), 959–969.CrossRefGoogle Scholar
  11. Studer, T. (2009). Common knowledge does not have the Beth property. Information Processing Letters, 109(12), 611–614.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2014

Authors and Affiliations

  1. 1.Department of Mathematics and Computer ScienceMcDaniel CollegeWestminsterUSA

Personalised recommendations