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. (shrink)

(1984). Conditional blindspots and the knowledge squeeze: A solution to the prediction paradox. Australasian Journal of Philosophy: Vol. 62, No. 2, pp. 126-135.

According to a familiar argument, iterated prisoner's dilemmas of known finite lengths resolve for ideally rational and well-informed players: They would defect in the last round, anticipate this in the next to last round and so defect in it, and so on. But would they anticipate defections even if they had been cooperating? Not necessarily, say recent critics. These critics "lose" the backward-induction paradox by imposing indicative interpretations on rationality and information conditions. To regain it I propose subjunctive interpretations. To (...) solve it I stress that implications for ordinary imperfect players are limited. (shrink)

The Surprise Exam Paradox continues to perplex and torment despite the many solutions that have been offered. This paper proposes to end the intrigue once and for all by refuting one of the central pillars of the Surprise Exam Paradox, the 'No Friday Argument,' which concludes that an exam given on the last day of the testing period cannot be a surprise. This refutation consists of three arguments, all of which are borrowed from the literature: the 'Unprojectible Announcement Argument,' the (...) 'Wright & Sudbury Argument,' and the 'Epistemic Blindspot Argument.' The reason that the Surprise Exam Paradox has persisted this long is not because any of these arguments is problematic. On the contrary, each of them is correct. The reason that it has persisted so long is because each argument is only part of the solution. The correct solution requires all three of them to be combined together. Once they are, we may see exactly why the No Friday Argument fails and therefore why we have a solution to the Surprise Exam Paradox that should stick. (shrink)

We examine the paradox of the surprise examination using dynamic epistemic logic. This logic contains means of expressing epistemic facts as well as the effects of learning new facts, and is therefore a natural framework for representing the puzzle. We discuss a number of different interpretations of the puzzle in this context, and show how the failure of principle of success, that states that sentences, when learned, remain to be true and come to be believed, plays a central role in (...) understanding the puzzle. (shrink)

ON BROUWER, like other titles in the Wadsworth Philosopher's Series, offers a concise, yet comprehensive, introduction to this philosopher's most important ideas. Presenting the most important insights of well over a hundred seminal philosophers in both the Eastern and Western traditions, the Wadsworth Philosophers Series contains volumes written by scholars noted for their excellence in teaching and for their well-versed comprehension of each featured philosopher's major works and contributions. These titles have proven valuable in a number of ways. Serving as (...) standalone texts when tackling a philosophers' original sources or as helpful resources for focusing philosophy students' engagements with these philosopher's often conceptually daunting works, these titles have also gained extraordinary popularity with a lay readership and quite often serve as "refreshers" for philosophy instructors. (shrink)

We give a new proof for Godel's second incompleteness theorem, based on Kolmogorov complexity, Chaitin's incompleteness theorem, and an argument that resembles the surprise examination paradox. We then go the other way around and suggest that the second incompleteness theorem gives a possible resolution of the surprise examination paradox. Roughly speaking, we argue that the flaw in the derivation of the paradox is that it contains a hidden assumption that one can prove the consistency of the mathematical theory in which (...) the derivation is done; which is impossible by the second incompleteness theorem. (shrink)