David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Synthese 151 (2):201-232 (2006)
In an information state where various agents have both factual knowledge and knowledge about each other, announcements can be made that change the state of information. Such informative announcements can have the curious property that they become false because they are announced. The most typical example of that is ‘fact p is true and you don’t know that’, after which you know that p, which entails the negation of the announcement formula. The announcement of such a formula in a given information state is called an unsuccessful update. A successful formula is a formula that always becomes common knowledge after being announced. Analysis of information systems and ‘philosophical puzzles’ reveals a growing number of dynamic phenomena that can be described or explained by unsuccessful updates. This increases our understanding of such philosophical problems. We also investigate the syntactic characterization of the successful formulas
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
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.
Citations of this work BETA
Patrick Allo (2013). The Many Faces of Closure and Introspection. Journal of Philosophical Logic 42 (1):91-124.
Tomohiro Hoshi & Audrey Yap (2009). Dynamic Epistemic Logic with Branching Temporal Structures. Synthese 169 (2):259 - 281.
Philippe Balbiani, Alexandru Baltag, Hans van Ditmarsch, Andreas Herzig, Tomohiro Hoshi & Tiago de Lima (2008). Knowable' as 'Known After an Announcement. Review of Symbolic Logic 1 (3):305-334.
Jiahong Guo (2009). The Incorporation of Moorean Type Information by Introspective Agents. Frontiers of Philosophy in China 4 (3):470-482.
Fenrong Liu & Yanjing Wang (2013). Reasoning About Agent Types and the Hardest Logic Puzzle Ever. Minds and Machines 23 (1):123-161.
Similar books and articles
Nina Gierasimczuk & Jakub Szymanik (2011). Invariance Properties of Quantifiers and Multiagent Information Exchange. In M. Kanazawa (ed.), Proceedings of the 12th Meeting on Mathematics of Language, Lecture Notes in Artificial Intelligence 6878. Springer.
Joseph Agassi (1970). Positive Evidence in Science and Technology. Philosophy of Science 37 (2):261-270.
Hans van Ditmarsch, Wiebe van der Hoek & Petar Iliev (2011). Everything is Knowable – How to Get to Know Whether a Proposition is True. Theoria 78 (2):93-114.
Hans P. Van Ditmarsch (2005). Prolegomena to Dynamic Logic for Belief Revision. Synthese 147 (2):229 - 275.
Hans P. Van Ditmarsch (2005). Prolegomena to Dynamic Logic for Belief Revision. Synthese 147 (2):229-275.
Hans Van Ditmarsch & Barteld Kooi (2006). The Secret of My Success. Synthese 153 (2):201 - 232.
Barteld Kooi & Hans Van Ditmarsch (2006). The Secret of My Success. Synthese 153 (2):201 - 232.
Added to index2009-01-28
Total downloads15 ( #112,797 of 1,100,083 )
Recent downloads (6 months)5 ( #66,994 of 1,100,083 )
How can I increase my downloads?