It is a little understood fact that the system of formal logic presented in Wittgenstein?s Tractatusprovides the basis for an alternative general semantics for a predicate calculus that is consistent and coherent, essentially independent of the metaphysics of logical atomism, and philosophically illuminating in its own right. The purpose of this paper is threefold: to describe the general characteristics of a Tractarian-style semantics, to defend the Tractatus system against the charge of expressive incompleteness as levelled by Robert Fogelin, and to (...) give a semantics for a formal language that is the Tractarian equivalent of a first-order predicate calculus. Of note in regard to the latter is the fact that a Tractatusstyle truth-definition makes no appeal to the technical trick of defining truth in terms of the satisfaction of predicates by infinite sequences of objects, yet is materially equivalent to the usual Tarski-style truth-definitions. (shrink)

"A valuable collection both for original source material as well as historical formulations of current problems."-- The Review of Metaphysics "Much more than a mere collection of papers . . . a valuable addition to the literature."-- Mathematics of Computation An anthology of fundamental papers on undecidability and unsolvability by major figures in the field, this classic reference opens with Godel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by (...) Godel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. Additional papers by Church, Turing, and Post cover unsolvable problems from the theory of abstract computing machines, mathematical logic, and algebra, and material by Kleene and Post includes initiation of the classification theory of unsolvable problems. Suitable for graduate and undergraduate courses. 1965 ed. (shrink)