Muddy Children, Generalized Quantifiers and Internal Complexity

Abstract

This paper generalizes Muddy Children puzzle to account for a large class of possible public announcements with various quantifiers. We identify conditions for solvability of the extended puzzle, with its classical version as a particular case. The characterization suggests a novel way of modeling multi-agent epistemic reasoning. The framework is based on the concept of number triangle. The advantage of our approach over more general formalizations in epistemic logics, like Dynamic Epistemic Logic, is that it gives models of linear size w.r.t. the number of agents. Therefore, it is computationally plausible for modeling agents’ internal perspective

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Verifying one hundred prisoners and a lightbulb.Hans van Ditmarsch & Jan van Eijck - 2010 - Journal of Applied Non-Classical Logics 20 (3):173-191.

Analytics

Added to PP
2010-08-01

Downloads
6 (#1,694,809)

6 months
6 (#858,075)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references