Authors
Nina Gierasimczuk
University of Groningen
Jakub Szymanik
University of Amsterdam
Abstract
We study a generalization of the Muddy Children puzzle by allowing public announcements with arbitrary generalized quantifiers. We propose a new concise logical modeling of the puzzle based on the number triangle representation of quantifi ers. Our general aim is to discuss the possibility of epistemic modeling that is cut for specifi c informational dynamics. Moreover, we show that the puzzle is solvable for any number of agents if and only if the quanti fier in the announcement is positively active (satis es a form of variety).
Keywords Muddy Children Puzzles  epistemic logic  generalized quantifiers
Categories (categorize this paper)
Buy the book Find it on Amazon.com
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Translate to english
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 63,219
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

No references found.

Add more references

Citations of this work BETA

Tractability and the Computational Mind.Rineke Verbrugge & Jakub Szymanik - 2018 - In Mark Sprevak & Matteo Colombo (eds.), The Routledge Handbook of the Computational Mind. Oxford, UK: pp. 339-353.
A Computational Learning Semantics for Inductive Empirical Knowledge.Kevin T. Kelly - 2014 - In Alexandru Baltag & Sonja Smets (eds.), Johan van Benthem on Logic and Information Dynamics. Springer International Publishing. pp. 289-337.

Add more citations

Similar books and articles

Temporal Languages for Epistemic Programs.Joshua Sack - 2008 - Journal of Logic, Language and Information 17 (2):183-216.
The Hierarchy Theorem for Second Order Generalized Quantifiers.Juha Kontinen - 2006 - Journal of Symbolic Logic 71 (1):188 - 202.
Definability of Polyadic Lifts of Generalized Quantifiers.Lauri Hella, Jouko Väänänen & Dag Westerståhl - 1997 - Journal of Logic, Language and Information 6 (3):305-335.

Analytics

Added to PP index
2011-10-07

Total views
51 ( #208,562 of 2,448,389 )

Recent downloads (6 months)
1 ( #450,223 of 2,448,389 )

How can I increase my downloads?

Downloads

My notes