In chapter 5 of Knowledge and its Limits, T. Williamson formulates an argument against the principle (KK) of epistemic transparency, or luminosity of knowledge, namely “that if one knows something, then one knows that one knows it”. Williamson’s argument proceeds by reductio: from the description of a situation of approximate knowledge, he shows that a contradiction can be derived on the basis of principle (KK) and additional epistemic principles that he claims are better grounded. One of them is a reflective (...) form of the margin for error principle defended by Williamson in his account of knowledge. We argue that Williamson’s reductio rests on the inappropriate identification of distinct forms of knowledge. More specifically, an important distinction between perceptual knowledge and non-perceptual knowledge is wanting in his statement and analysis of the puzzle. We present an alternative account of this puzzle, based on a modular conception of knowledge: the (KK) principle and the margin for error principle can coexist, provided their domain of application is referred to the right sort of knowledge. (shrink)

Reasoning About Knowledge is the first book to provide a general discussion of approaches to reasoning about knowledge and its applications to distributed ...

Vagueness provides the first comprehensive examination of a topic of increasing importance in metaphysics and the philosophy of logic and language. Timothy Williamson traces the history of this philosophical problem from discussions of the heap paradox in classical Greece to modern formal approaches such as fuzzy logic. He illustrates the problems with views which have taken the position that standard logic and formal semantics do not apply to vague language, and defends the controversial realistic view that vagueness is a kind (...) of ignorance--that there really is a grain of sand whose removal turns a heap into a non-heap, but we cannot know which one it is. (shrink)

Most of our knowledge is inexact, and known by us to be so. An example of such known inexactness will be described in some detail. The description seems to entail a contradiction. However, the paradoxical reasoning rests on an assumption. It will be suggested that the description is correct and this assumption false. Its failure will be explained by means of a picture of inexact knowledge in which the notion of a margin for error is central. This picture suggests diagnoses (...) of other paradoxical arguments: Surprise Examinations, backwards inductions about Iterated Prisoner's Dilemma, and the Heap. (shrink)

A hypermodality is a connective □ whose meaning depends on where in the formula it occurs. The paper motivates the notion and shows that hypermodal logics are much more expressive than traditional modal logics. In fact we show that logics with very simple K hypermodalities are not complete for any neighbourhood frames.

Version of March 05, 2007. An extended abstract of the paper appeared in the Proceedings of the 2006 Prague Colloquium on "Reasoning about Vagueness and Uncertainty".

There are many examples in the literature that suggest that indistinguishability is intransitive, despite the fact that the indistinguishability relation is typically taken to be an equivalence relation (and thus transitive). It is shown that if the uncertainty perception and the question of when an agent reports that two things are indistinguishable are both carefully modeled, the problems disappear, and indistinguishability can indeed be taken to be an equivalence relation. Moreover, this model also suggests a logic of vagueness that seems (...) to solve many of the problems related to vagueness discussed in the philosophical literature. In particular, it is shown here how the logic can handle the sorites paradox. (shrink)

This modern, advanced textbook reviews modal logic, a field which caught the attention of computer scientists in the late 1970's.

Modern modal logic originated as a branch of philosophical logic in which the concepts of necessity and possibility were investigated by means of a pair of dual operators that are added to a propositional or first-order language. The field owes much of its flavor and success to the introduction in the 1950s of the “possible-worlds” semantics in which the modal operators are interpreted via some “accessibility relation” connecting possible worlds. In subsequent years, modal logic has received attention as an attractive (...) approach towards formalizing such diverse notions as time, knowledge, or action. Nowadays, modal logics are applied in various disciplines, ranging from economics to linguistics and computer science. Consequently, there is by now a large variety of modal languages, with an even greater wealth of interpretations. For instance, many applications require a poly-modal framework consisting of a language with a family of modal operators and a semantics in which the corresponding accessibility relations are connected somehow. (shrink)

Lemmon and Scott introduced the notion of a modal system's providing the rule of disjunction. No consistent normal extension of KB provides this rule. An alternative rule is defined, which KDB, KTB, and other systems are shown to provide, while K and other systems provide the Lemmon-Scott rule but not the alternative rule. If S provides the alternative rule then either —A is a theorem of S or A is whenever A -> ΠA is a theorem; the converse fails. It (...) is suggested that systems with this property are appropriate for handling sorites paradoxes, where D is read as 'clearly*. The S4 axiom fails in such systems. (shrink)

Forthcoming in D.H. Pritchard & V. Hendricks, New Waves in Epistemology,.

Forthcoming in D.H. Pritchard & V. Hendricks, New Waves in Epistemology,.