Muddy Children, Generalized Quantifiers and Internal Complexity


Συγγραφέας: Nina Gierasimczuk


Nina Gierasimczuk: Muddy Children, Generalized Quantifiers and Internal Complexity (pdf, 12 pages)
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.