The long‐standing issue of Wittgenstein's controversial remarks on Gödel's Theorem has recently heated up in a number of different and interesting directions [,, ]. In their, Juliet Floyd and Hilary Putnam purport to argue that Wittgenstein's‘notorious’ “Contains a philosophical claim of great interest,” namely, “if one assumed. that →P is provable in Russell's system one should… give up the “translation” of P by the English sentence ‘P is not provable’,” because if ωP is provable in PM, PM is ω ‐inconsistent, (...) and if PM is ω‐inconsistent, we cannot translate ‘P’as ’P is not provable in PM’because the predicate‘NaturalNo.’in ‘P’“cannot be…interpreted” as “x is a natural number.” Though Floyd and Putnam do not clearly distinguish the two tasks, they also argue for “The Floyd‐Putnam Thesis,” namely, that in the 1930's Wittgenstein had a particular understanding of Gödel's First Incompleteness Theorem. In this paper, I endeavour to show, first, that the most natural and most defensible interpretation of Wittgenstein's and the rest of is incompatible with the Floyd‐Putnam attribution and, second, that evidence from Wittgenstein's Nachla strongly indicates that the Floyd‐ Putnam attribution and the Floyd‐Putnam Thesis are false. By way of this examination, we shall see that despite a failure to properly understand Gödel's proof—perhaps because, as Kreisel says, Wittgenstein did not read Gödel's 1931 paper prior to 1942‐Wittgenstein's 1937–38, 1941 and 1944 remarks indicate that Gödel's result makes no sense from Wittgenstein's own perspective. (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.

This book is dedicated to a classic presentation of the theory of computable functions in the context of the foundations of mathematics. Part I motivates the study of computability with discussions and readings about the crisis in the foundations of mathematics in the early 20th century, while presenting the basic ideas of whole number, function, proof, and real number. Part II starts with readings from Turing and Post leading to the formal theory of recursive functions. Part III presents sufficient formal (...) logic to give a full development of Gödel's incompleteness theorems. Part IV considers the significance of the technical work with a discussion of Church's Thesis and readings on the foundations of mathematics. This new edition contains the timeline "Computability and Undecidability" as well as the essay "On mathematics". (shrink)

Notes taken by these last four are the basis for the thirty-one lectures in this book.

We begin with the history of the discovery of computability in the 1930’s, the roles of Gödel, Church, and Turing, and the formalisms of recursive functions and Turing automatic machines . To whom did Gödel credit the definition of a computable function? We present Turing’s notion [1939, §4] of an oracle machine and Post’s development of it in [1944, §11], [1948], and finally Kleene-Post [1954] into its present form. A number of topics arose from Turing functionals including continuous functionals on (...) Cantor space and online computations. Almost all the results in theoretical computability use relative reducibility and o-machines rather than a-machines and most computing processes in the real world are potentially online or interactive. Therefore, we argue that Turing o-machines, relative computability, and online computing are the most important concepts in the subject, more so than Turing a-machines and standard computable functions since they are special cases of the former and are presented first only for pedagogical clarity to beginning students. At the end in §10–§13 we consider three displacements in computability theory, and the historical reasons they occurred. Several brief conclusions are drawn in §14. (shrink)

In the general theory of logic built up by Whitehead and Russell to furnish a basis for all mathematics there is a certain subtheory which is unique in its simplicity and precision; and though all other portions of the work have their roots in this subtheory, it itself is completely independent of them. Whereas the complete theory requires for the enunciation of its propositions real and apparent variables, which represent both individuals and propositional functions of different kinds, and as a (...) result necessitates- the introduction of the cumbersome theory of types, this subtheory uses only real variables, and these real variables represent but one kind of entity—which the authors have chosen to call elementary propositions. The most general statements are formed by merely combining these variables by means of the two primitive propositional functions of propositions Negation and Disjunction; and the entire theory is concerned with the process of asserting those combinations which it regards as true propositions, employing for this purpose a few general rules which tell how to assert new combinations from old, and a certain number of primitive assertions from which to begin. (shrink)

Taking Chomsky’s Syntactic Structures as a starting point, this paper explores the use of recursive techniques in contemporary linguistic theory. Specifically, it is shown that there were profound ambiguities surrounding the notion of recursion in the 1950s, and that this was partly due to the fact that influential texts such as Syntactic Structures neglected to define what exactly constituted a recursive device. As a result, uncertainties concerning the role of recursion in linguistic theory have prevailed until the present day, and (...) some of the most common misunderstandings that have appeared in recent discussions are examined at some length. This article shows that debates about such topics are frequently undermined by fundamental misunderstandings concerning core terminology, and the full extent of the prevailing haziness is revealed. An attempt is made, for instance, to distinguish between such things as iterative constructional devices and self-similar syntactic embedding, despite the fact that these are usually both unhelpfully classified as examples of recursion. Consequently, this article effectively constitutes a plea for much greater accuracy and clarity when such important issues are addressed from a linguistic perspective. (shrink)

Stephen Cole Kleene was one of the greatest logicians of the twentieth century and this book is the influential textbook he wrote to teach the subject to the next generation. It was first published in 1952, some twenty years after the publication of Godel's paper on the incompleteness of arithmetic, which marked, if not the beginning of modern logic. The 1930s was a time of creativity and ferment in the subject, when the notion of computable moved from the realm of (...) philosophical speculation to the realm of science. This was accomplished by the work of Kurt Gode1, Alan Turing, and Alonzo Church, who gave three apparently different precise definitions of computable. When they all turned out to be equivalent, there was a collective realization that this was indeed the right notion. Kleene played a key role in this process. One could say that he was there at the beginning of modern logic. He showed the equivalence of lambda calculus with Turing machines and with Godel's recursion equations, and developed the modern machinery of partial recursive functions. This textbook played an invaluable part in educating the logicians of the present. It played an important role in their own logical education.". (shrink)

The Pirahã language challenges simplistic application of Hockett’s nearly universally accepted design features of human language by showing that some of these features may be culturally constrained. In particular, Pirahã culture constrains communication to nonabstract subjects which fall within the immediate experience of interlocutors. This constraint explains a number of very surprising features of Pirahã grammar and culture: the absence of numbers of any kind or a concept of counting and of any terms for quantification, the absence of color terms, (...) the absence of embedding, the simplest pronoun inventory known, the absence of "relative tenses," the simplest kinship system yet documented, the absence of creation myths and fiction, the absence of any individual or collective memory of more than two generations past, the absence of drawing or other art and one of the simplest material cultures documented, and the fact that the Pirahã are monolingual after more than 200 years of regular contact with Brazilians and the Tupi-Guarani-speaking Kawahiv. (shrink)

Chomsky proposes a reformulation of the theory of transformational generative grammar that takes recent developments in the descriptive analysis of particular ...

In these essays the minimalist approach to linguistic theory is formulated and progressively developed.

pt. 1. The proposition and its sense.--pt. 2. On logic and mathematics.

When in May 1930, the Council of Trinity College, Cambridge, had to decide whether to renew Wittgenstein's research grant, it turned to Bertrand Russell for an assessment of the work Wittgenstein had been doing over the past year. His verdict: "The theories contained in this new work . . . are novel, very original and indubitably important. Whether they are true, I do not know. As a logician who likes simplicity, I should like to think that they are not, but (...) from what I have read of them I am quite sure that he ought to have an opportunity to work them out, since, when completed, they may easily prove to constitute a whole new philosophy." "[ Philosophical Remarks ] contains the seeds of Wittgenstein's later philosophy of mind and of mathematics. Principally, he here discusses the role of indispensable in language, criticizing Russell's The Analysis of Mind . He modifies the Tractatus 's picture theory of meaning by stressing that the connection between the proposition and reality is not found in the picture itself. He analyzes generality in and out of mathematics, and the notions of proof and experiment. He formulates a pain/private-language argument and discusses both behaviorism and the verifiability principle. The work is difficult but important, and it belongs in every philosophy collection."--Robert Hoffman, Philosophy "Any serious student of Wittgenstein's work will want to study his Philosophical Remarks as a transitional book between his two great masterpieces. The Remarks is thus indispensible for anyone who seeks a complete understanding of Wittgenstein's philosophy."--Leonard Linsky, American Philosophical Association. (shrink)

What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr Cutland (...) begins with a mathematical characterisation of computable functions using a simple idealised computer (a register machine); after some comparison with other characterisations, he develops the mathematical theory, including a full discussion of non-computability and undecidability, and the theory of recursive and recursively enumerable sets. The later chapters provide an introduction to more advanced topics such as Gildel's incompleteness theorem, degrees of unsolvability, the Recursion theorems and the theory of complexity of computation. Computability is thus a branch of mathematics which is of relevance also to computer scientists and philosophers. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest. (shrink)

Wittgenstein finished part 1 of the Philosophical Investigations in the spring of 1945. From 1946 to 1949 he worked on the philosophy of psychology almost without interruption. The present two-volume work comprises many of his writings over this period. Some of the remarks contained here were culled for part 2 of the Investigations ; others were set aside and appear in the collection known as Zettel . The great majority, however, although of excellent quality, have hitherto remained unpublished. This bilingual (...) edition of the Remarks on the Philosophy of Psychology presents the first English translation of an essential body of Wittegenstein's work. It elaborates Wittgenstein's views on psychological concepts such as expectation, sensation, knowing how to follow a rule, and knowledge of the sensations of other persons. It also shows strong emphasis on the "anthropological" aspect of Wittgenstein's thought. Philosophers, as well as anthropologists, psychologists, and sociologists will welcome this important publication. (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)

Undergraduate students with no prior classroom instruction in mathematical logic will benefit from this evenhanded multipart text by one of the centuries greatest authorities on the subject. Part I offers an elementary but thorough overview of mathematical logic of first order. The treatment does not stop with a single method of formulating logic; students receive instruction in a variety of techniques, first learning model theory (truth tables), then Hilbert-type proof theory, and proof theory handled through derived rules. Part II supplements (...) the material covered in Part I and introduces some of the newer ideas and the more profound results of logical research in the twentieth century. Subsequent chapters introduce the study of formal number theory, with surveys of the famous incompleteness and undecidability results of Godel, Church, Turing, and others. The emphasis in the final chapter reverts to logic, with examinations of Godel's completeness theorem, Gentzen's theorem, Skolem's paradox and nonstandard models of arithmetic, and other theorems. Unabridged republication of the edition published by John Wiley & Sons, Inc. New York, 1967. Preface. Bibliography. Theorem and Lemma Numbers: Pages. List of Postulates. Symbols and Notations. Index. (shrink)

This is a remarkable book about a man (perhaps the most important and original philosopher of our age), a society (the corrupt Austro-Hungarian Empire on the eve of dissolution), and a city (Vienna, with its fin-de siecle gaiety and corrosive melancholy). The central figure in this study of a crumbling society that gave birth to the modern world is Wittgenstein, the brilliant and gifted young thinker. With others, including Freud, Viktor Adler, and Arnold Schoenberg, he forged his ideas in a (...) classical revolt against the stuffy, doomed, and moralistic lives of the old regime. As a portrait of Wittgenstein, the book is superbly realized; it is even better as a portrait of the age, with dazzling and unusual parallels to our own confused society. Allan Janik and Stephen Toulmin have acted on a striking premise: an understanding of prewar Vienna, Wittgenstein s native city, will make it easier to comprehend both his work and our own problems .This is an independent work containing much that is challenging, new, and useful. New York Times Book Review.". (shrink)

v. 1. Preliminary studies for part II of the Philosophical investigations -- v. 2. The inner and the outer, 1949-1951.

We examine the question of which aspects of language are uniquely human and uniquely linguistic in light of recent suggestions by Hauser, Chomsky, and Fitch that the only such aspect is syntactic recursion, the rest of language being either specific to humans but not to language (e.g. words and concepts) or not specific to humans (e.g. speech perception). We find the hypothesis problematic. It ignores the many aspects of grammar that are not recursive, such as phonology, morphology, case, agreement, and (...) many properties of words. It is inconsistent with the anatomy and neural control of the human vocal tract. And it is weakened by experiments suggesting that speech perception cannot be reduced to primate audition, that word learning cannot be reduced to fact learning, and that at least one gene involved in speech and language was evolutionarily selected in the human lineage but is not specific to recursion. The recursion-only claim, we suggest, is motivated by Chomsky’s recent approach to syntax, the Minimalist Program, which de-emphasizes the same aspects of language. The approach, however, is sufficiently problematic that it cannot be used to support claims about evolution. We contest related arguments that language is not an adaptation, namely that it is “perfect,” non-redundant, unusable in any partial form, and badly designed for.. (shrink)

In this paper, elementary but hitherto overlooked connections are established between Wittgenstein's remarks on mathematics, written during his transitional period, and free-variable finitism. After giving a brief description of theTractatus Logico-Philosophicus on quantifiers and generality, I present in the first section Wittgenstein's rejection of quantification theory and his account of general arithmetical propositions, to use modern jargon, as claims (as opposed to statements). As in Skolem's primitive recursive arithmetic and Goodstein's equational calculus, Wittgenstein represented generality by the use of free (...) variables. This has the effect that negation of unbounded universal and existential propositions cannot be expressed. This is claimed in the second section to be the basis for Wittgenstein's criticism of the universal validity of the law of excluded middle. In the last section, there is a brief discussion of Wittgenstein's remarks on real numbers. These show a preference, in line with finitism, for a recursive version of the continuum. (shrink)

First English translation of revolutionary paper that established that even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. Introduction by R. B. Braithwaite.

Wittgenstein's work remains, undeniably, now, that off one of those few philosophers who will be read by all future generations.