Winner of the Wolf Prize for his contribution to our understanding of the universe, Penrose takes on the question of whether artificial intelligence will ever ...

This new work provides an approachable introduction to the complex system that Making It Explicit mapped out.

The Taming of the True poses a broad challenge to realist views of meaning and truth that have been prominent in recent philosophy. Neil Tennant argues compellingly that every truth is knowable, and that an effective logical system can be based on this principle. He lays the foundations for global semantic anti-realism and extends its consequences from the philosophy of mathematics and logic to the theory of meaning, metaphysics, and epistemology.

Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel's incompleteness theorems, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a (...) simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems. This updated edition is also accompanied by a website as well as an instructor's manual. (shrink)

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)

Lucas and Penrose have contended that, by displaying how any characterisation of arithmetical proof programmable into a machine allows of diagonalisation, generating a humanly recognisable proof which eludes that characterisation, Gödel's incompleteness theorem rules out any purely mechanical model of the human intellect. The main criticisms of this argument have been that the proof generated by diagonalisation (i) will not be humanly recognisable unless humans can grasp the specification of the object-system (Benacerraf); and (ii) counts as a proof only on (...) the (unproven) hypothesis that the object system is consistent (Putnam). The present paper argues that criticism (ii) may be met head-on by an intuitionistic proponent of the anti-mechanist argument; and that criticism (i) is simply mistaken. However the paper concludes by questioning the sufficiency of the situation for an interesting anti-mechanist conclusion. (shrink)

In this paper Lucas suggests that many of his critics have not read carefully neither his exposition nor Penrose’s one, so they seek to refute arguments they never proposed. Therefore he offers a brief history of the Gödelian argument put forward by Gödel, Penrose and Lucas itself: Gödel argued indeed that either mathematics is incompletable – that is axioms can never be comprised in a finite rule and so human mind surpasses the power of any finite machine – or there (...) exist absolutely unsolvable diophantine problems, and he suggest that the second disjunct is untenable; on the other side, Penrose proposed an argument similar to Lucas’ one but making use of Turing’s theorem. Finally Lucas exposes again his argument and considers some of the most important objections to it. (shrink)

Crispin Wright joins the ranks of those who have sought to refute mechanist theories of mind by invoking Gödel's Incompleteness Theorems. His predecessors include Gödel himself, J. R. Lucas and, most recently, Roger Penrose. The aim of this essay is to show that, like his predecessors, Wright, too, fails to make his case, and that, indeed, he fails to do so even when judged by standards of success which he himself lays down.

Lucas and Penrose have contended that, by displaying how any characterisation of arithmetical proof programmable into a machine allows of diagonalisation, generating a humanly recognisable proof which eludes that characterisation, Gödel's incompleteness theorem rules out any purely mechanical model of the human intellect. The main criticisms of this argument have been that the proof generated by diagonalisation will not be humanly recognisable unless humans can grasp the specification of the object-system ; and counts as a proof only on the hypothesis (...) that the object system is consistent. The present paper argues that criticism may be met head-on by an intuitionistic proponent of the anti-mechanist argument; and that criticism is simply mistaken. However the paper concludes by questioning the sufficiency of the situation for an interesting anti-mechanist conclusion. (shrink)

A central tenet of cognitivism is that knowing how is to be explained in terms of tacitly knowing that a theory is true. By critically examining canonical anti-behaviorist arguments and contemporary appeals to tacit knowledge, I have devised a more explicit characterization in which tacitly known theories must act as justifiers for claims that the tacit knower is capable of explicitly endorsing. In this manner the new account is specifically tied to verbal behavior. In addition, if the analysis is correct (...) then it follows that the scope and nature of cognitivist appeals to tacit knowledge are largely mistaken. (shrink)

If correct, Christopher Peacocke’s [20] “manifestationism without verificationism,” would explode the dichotomy between realism and inferentialism in the contemporary philosophy of language. I first explicate Peacocke’s theory, defending it from a criticism of Neil Tennant’s. This involves devising a recursive definition for grasp of logical contents along the lines Peacocke suggests. Unfortunately though, the generalized account reveals the Achilles’ heel of the whole theory. By inventing a new logical operator with the introduction rule for the existential quantifier and the elimination (...) rule for the universal quantifier, I am able to show that Peacocke’s theory only avoids verificationism to the extent that it does not satisfy manifestationism. (shrink)

Neil Tennant and Joseph Salerno have recently attempted to rigorously formalize Michael Dummett's argument for logical revision. Surprisingly, both conclude that Dummett commits elementary logical errors, and hence fails to offer an argument that is even prima facie valid. After explicating the arguments Salerno and Tennant attribute to Dummett, I show how broader attention to Dummett's writings on the theory of meaning allows one to discern, and formalize, a valid argument for logical revision. Then, after correctly providing a rigorous statement (...) of the argument, I am able to delineate four possible anti-Dummettian responses. Following recent work by Stewart Shapiro and Crispin Wright, I conclude that progress in the anti-realist's dialectic requires greater clarity about the key modal notions used in Dummett's proof. (shrink)

In "Revising the Logic of Logical Revision" J. Salerno attempts to undermine Crispin Wright's recent arguments for intuitionism, and to replace Wright and Dummett's arguments with a revisionary argument of his own. I show that Salerno's criticisms of Wright involve both attributing an inference to Wright that no intuitionist would make and fallaciously treating a negative universal as an existential negative. Then I show how very general considerations about the nature of warrant undermine both Wright and Salerno's arguments, when these (...) arguments are applied to discourses with defeasible warrants. While Salerno explicitly restricts his discussion to mathematics, Wright and Dummett intend their revisionary arguments to have much wider scope. (shrink)