The secret of my success
| Abstract | 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) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,709 |
| External links |
|
| Through your library | Only published papers are available at libraries |
Hans Van Ditmarsch & Barteld Kooi (2006). The Secret of My Success. Synthese 151 (2).
Hans Van Ditmarsch & Barteld Kooi (2006). The Secret of My Success. Synthese 153 (2):201 - 232.
Hans P. Van Ditmarsch (2005). Prolegomena to Dynamic Logic for Belief Revision. Synthese 147 (2):229 - 275.
Wesley H. Holliday & Thomas F. Icard (2010). Moorean Phenomena in Epistemic Logic. In Lev Beklemishev, Valentin Goranko & Valentin B. Shehtman (eds.), Advances in Modal Logic 8. College Publications.
John Cantwell (2007). A Model for Updates in a Multi-Agent Setting. Journal of Applied Non-Classical Logics 17 (2):183-196.
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.
Joseph Agassi (1970). Positive Evidence in Science and Technology. Philosophy of Science 37 (2):261-270.
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.
Jiahong Guo (2009). The Incorporation of Moorean Type Information by Introspective Agents. Frontiers of Philosophy in China 4 (3):470-482.
Wiebe van der Hoek & Elias Thijsse (2002). A General Approach to Multi-Agent Minimal Knowledge: With Tools and Samples. Studia Logica 72 (1):61-84.
Wiebe van Der Hoek & Elias Thijsse (2002). A General Approach to Multi-Agent Minimal Knowledge: With Tools and Samples. Studia Logica 72 (1):61 - 84.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2011-11-25Total downloads0Recent downloads (6 months)0How can I increase my downloads? |

