Abstract
The paper presents two case studies of multi-agent information exchange involving generalized quantifiers. We focus on scenarios in which agents successfully converge to knowledge on the basis of the information about the knowledge of others, so-called Muddy Children puzzle [1] and Top Hat puzzle. We investigate the relationship between certain invariance properties of quantifiers and the successful convergence to knowledge in such situations. We generalize the scenarios to account for public announcements with arbitrary quantifiers. We show that the Muddy Children puzzle is solvable for any number of agents if and only if the quantifier in the announcement is positively active (satisfies a version of the variety condition). In order to get the characterization result, we propose a new concise logical modeling of the puzzle based on the number triangle representation of generalized quantifiers. In a similar vein, we also study the Top Hat puzzle. We observe that in this case an announcement needs to satisfy stronger conditions in order to guarantee solvability. Hence, we introduce a new property, called bounded thickness, and show that the solvability of the Top Hat puzzle for arbitrary number of agents is equivalent to the announcement being 1-thick.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Littlewood: A mathematician’s miscellany. Meuthen, London (1953)
Van Ditmarsch, H., Van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Springer, Netherlands (2007)
Gierasimczuk, N., Szymanik, J.: A note on a generalization of the muddy children puzzle. In: Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2011), Groningen, The Netherlands, July 12-14. ACM, New York (2011)
Gierasimczuk, N.: Knowing One’s Limits. Logical analysis of inductive inference. PhD thesis, Universiteit van Amsterdam (2010)
Mostowski, A.: On a generalization of quantifiers. Fundamenta Mathematicae 44, 12–36 (1957)
Van Benthem, J.: Essays in Logical Semantics. D. Reidel, Dordrecht (1986)
Peters, S., Westerståhl, D.: Quantifiers in Language and Logic. Oxford University Press, Oxford (2006)
Van Benthem, J.: Questions about quantifiers. Journal of Symbolic Logic 49(2), 443–466 (1984)
Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Sciences 21(1), 46–62 (1980)
Gold, E.: Language identification in the limit. Information and Control 10, 447–474 (1967)
Tiede, H.J.: Identifiability in the limit of context-free generalized quantifiers. Journal of Language and Computation 1, 93–102 (1999)
Väänänen, J., Westerståhl, D.: On the Expressive Power of Monotone Natural Language Quantifiers over Finite Models. Journal of Philosophical Logic 31(4), 327–358 (2002)
Barwise, J., Cooper, R.: Generalized quantifiers and natural language. Linguistics and Philosophy 4, 159–219 (1981)
Jain, S., Osherson, D., Royer, J.S., Sharma, A.: Systems that Learn. MIT Press, Chicago (1999)
Kelly, K.: The Logic of Reliable Inquiry. Oxford University Press, Oxford (1996)
Dégremont, C., Gierasimczuk, N.: Finite identification from the viewpoint of epistemic update. Information and Computation 209, 383–396 (2011)
Gierasimczuk, N.: The problem of learning the semantics of quantifiers. In: ten Cate, B.D., Zeevat, H.W. (eds.) TbiLLC 2005. LNCS (LNAI), vol. 4363, pp. 117–126. Springer, Heidelberg (2007)
Szymanik, J.: Computational complexity of polyadic lifts of generalized quantifiers in natural language. Linguistics and Philosophy 33, 215–250 (2010)
Gierasimczuk, N.: Identification through inductive verification. In: Bosch, P., Gabelaia, D., Lang, J. (eds.) TbiLLC 2007. LNCS, vol. 5422, pp. 193–205. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gierasimczuk, N., Szymanik, J. (2011). Invariance Properties of Quantifiers and Multiagent Information Exchange. In: Kanazawa, M., Kornai, A., Kracht, M., Seki, H. (eds) The Mathematics of Language. MOL 2011. Lecture Notes in Computer Science(), vol 6878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23211-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-23211-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23210-7
Online ISBN: 978-3-642-23211-4
eBook Packages: Computer ScienceComputer Science (R0)