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)

_Identity and Discrimination_, originally published in 1990 and the first book by respected philosopher Timothy Williamson, is now reissued and updated with the inclusion of significant new material. Williamson here proposes an original and rigorous theory linking identity, a relation central to metaphysics, and indiscriminability, a relation central to epistemology.__ Updated and reissued edition of Williamson’s first publication, with the inclusion of significant new material Argues for an original cognitive account of the relation between identity and discrimination that has been (...) influential in the philosophy of perception Pioneers the use of epistemic logic to solve puzzles about indiscriminability Develops the application of techniques from mathematical logic to understand issues about identity over time and across possible worlds. (shrink)

Given any finite graph, which transitive graphs approximate it most closely and how fast can we find them? The answer to this question depends on the concept of “closest approximation” involved. In [8,9] a qualitative concept of best approximation is formulated. Roughly, a qualitatively best transitive approximation of a graph is a transitive graph which cannot be “improved” without also going against the original graph. A quantitative concept of best approximation goes back at least to [10]. A quantitatively best transitive (...) approximation is a transitive graph that makes the minimal number of mistakes against the original graph. In other words, the sum of the edges that are removed from and are added to the original graph is minimal. (shrink)