The Limits to Gossip: Second-Order Shared Knowledge of All Secrets is Unsatisfiable

Authors
Publication date 2022
Host editors
  • A. Ciabattoni
  • E. Pimentel
  • R.J.G.B. de Queiroz
Book title Logic, Language, Information, and Computation
Book subtitle 28th International Workshop, WoLLIC 2022, Iași, Romania, September 20–23, 2022 : proceedings
ISBN
  • 9783031152979
ISBN (electronic)
  • 9783031152986
Series Lecture Notes in Computer Science
Event 28th International Workshop on Logic, Language, Information and Computation, WoLLIC 2022
Pages (from-to) 237-249
Number of pages 13
Publisher Cham: Springer
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
Abstract

It is known that without synchronization via a global clock one cannot obtain common knowledge by communication. Moreover, it is folklore that without exchanging higher-level information arbitrary higher-level shared knowledge cannot be achieved. Here we make this result precise. We use epistemic logic to formally define “everyone knows that everyone knows that everyone knows all secrets” and then prove that this statement is unsatisfiable.
Document type Conference contribution
Language English
Published at https://doi.org/10.1007/978-3-031-15298-6_15
Other links https://www.scopus.com/pages/publications/85138826898
Permalink to this page
Back