In this book Saul Kripke brings his powerful philosophical intelligence to bear on Wittgenstein's analysis of the notion of following a rule.

Discussion of Wittgenstein's philosophy has suffered from a scarcity of commentators who understand his work well enough to explain it in their own words. Apart from certain notable exceptions, all too many advocates and critics alike have tended merely to repeat slogans, with approval or ridicule as the case may be. The result has been an unusual degree of polarization and acrimony—some philosophers abandoning normal critical standards, falling under the spell and becoming fanatical supporters; and others taking an equally extreme (...) opposite view, deriding the absence of analytic technique, and refusing to see anything of value in Wittgenstein's work. (shrink)

Editorial preface to the fourth edition and modified translation -- The text of the Philosophische Untersuchungen -- Philosophische untersuchungen = Philosophical investigations -- Philosophie der psychologie, ein fragment = Philosophy of psychology, a fragment.

We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consider methods of establishing such assertions using only restricted forms of distributivity. At the same time, we explore ways in which “local'’ decision or heuristic procedures for fragments of the theory of the reals can be amalgamated into global ones. Let $Tadd[QQ]$ be the first-order theory of the real numbers in the language with symbols $0, 1, +, -.

On a traditional view, the primary role of a mathematical proof is to warrant the truth of the resulting theorem. This view fails to explain why it is very often the case that a new proof of a theorem is deemed important. Three case studies from elementary arithmetic show, informally, that there are many criteria by which ordinary proofs are valued. I argue that at least some of these criteria depend on the methods of inference the proofs employ, and that (...) standard models of formal deduction are not well-equipped to support such evaluations. I discuss a model of proof that is used in the automated deduction community, and show that this model does better in that respect. (shrink)

The prime number theorem, established by Hadamard and de la Vallée Poussin independently in 1896, asserts that the density of primes in the positive integers is asymptotic to 1/ln x. Whereas their proofs made serious use of the methods of complex analysis, elementary proofs were provided by Selberg and Erdos in 1948. We describe a formally verified version of Selberg's proof, obtained using the Isabelle proof assistant.