Stewart Shapiro

§1. Overview. Philosophers and mathematicians have drawn lots of conclusions from Gödel's incompleteness theorems, and related results from mathematical logic. Languages, minds, and machines figure prominently in the discussion. Gödel's theorems surely tell us something about these important matters. But what?A descriptive title for this paper would be “Gödel, Lucas, Penrose, Turing, Feferman, Dummett, mechanism, optimism, reflection, and indefinite extensibility”. Adding “God and the Devil” would probably be redundant. Despite the breath-taking, whirlwind tour, I have the modest aim of forging connections between different parts of this literature and clearing up some confusions, together with the less modest aim of not introducing any more confusions.I propose to focus on three spheres within the literature on incompleteness. The first, and primary, one concerns arguments that Gödel's theorem refutes the mechanistic thesis that the human mind is, or can be accurately modeled as, a digital computer or a Turing machine. The most famous instance is the much reprinted J. R. Lucas [18]. To summarize, suppose that a mechanist provides plans for a machine,M, and claims that the output ofMconsists of all and only the arithmetic truths that a human, or the totality of human mathematicians, will ever or can ever know. We assume that the output ofMis consistent.

It is a commonplace that the extensions of most, perhaps all, vague predicates vary with such features as comparison class and paradigm and contrasting cases. My view proposes another, more pervasive contextual parameter. Vague predicates exhibit what I call open texture: in some circumstances, competent speakers can go either way in the borderline region. The shifting extension and anti-extensions of vague predicates are tracked by what David Lewis calls the “conversational score”, and are regulated by what Kit Fine calls penumbral connections, including a principle of tolerance. As I see it, vague predicates are response-dependent, or, better, judgement-dependent, at least in their borderline regions. This raises questions concerning how one reasons with such predicates. In this paper, I present a model theory for vague predicates, so construed. It is based on an overall supervaluationist-style framework, and it invokes analogues of Kripke structures for intuitionistic logic. I argue that the system captures, or at least nicely models, how one ought to reason with the shifting extensions (and anti-extensions) of vague predicates, as borderline cases are called and retracted in the course of a conversation. The model theory is illustrated with a forced march sorites series, and also with a thought experiment in which vague predicates interact with so-called future contingents. I show how to define various connectives and quantifiers in the language of the system, and how to express various penumbral connections and the principle of tolerance. The project fits into one of the topics of this special issue. In the course of reasoning, even with the external context held fixed, it is uncertain what the future extension of the vague predicates will be. Yet we still manage to reason with them. The system is based on that developed, more fully, in my Vagueness in Context , Oxford, Oxford University Press, 2006, but some criticisms and replies to critics are incorporated.

It is sometimes said that there are two, competing versions of W. V. O. Quine’s unrelenting empiricism, perhaps divided according to temporal periods of his career. According to one, logic is exempt from, or lies outside the scope of, the attack on the analytic-synthetic distinction. This logic-friendly Quine holds that logical truths and, presumably, logical inferences are analytic in the traditional sense. Logical truths are knowable a priori, and, importantly, they are incorrigible, and so immune from revision. The other, radical reading of Quine does not exempt logic from the attack on analyticity and a priority. Logical truths and inferences are themselves part of the web of belief, and the same global methodology applies to logic as to any other part of the web, such as theoretical chemistry or ordinary beliefs about ordinary objects. Everything, including logic, is up for grabs in our struggle for holistic confirmation. The purpose of this paper is to examine the law of non-contradiction, and the concomitant principle of ex falso quodlibet, from the perspective of the principles advocated by the radical Quine. I show that he has no compelling reason to accept either of these. To put it bluntly, neither the law of non-contradiction nor the rule of ex falso quodlibet is empirically confirmed, and these principles fare poorly on the various criteria for theory acceptance on the methodology of the radical Quine. So the radical Quine is led rather quickly and rather directly into something in the neighborhood of Graham Priest’s dialetheism.

The central contention of this book is that second-order logic has a central role to play in laying the foundations of mathematics. In order to develop the argument fully, the author presents a detailed description of higher-order logic, including a comprehensive discussion of its semantics. He goes on to demonstrate the prevalence of second-order concepts in mathematics and the extent to which mathematical ideas can be formulated in higher-order logic. He also shows how first-order languages are often insufficient to codify many concepts in contemporary mathematics, and thus that both first- and higher-order logics are needed to fully reflect current work. Throughout, the emphasis is on discussing the associated philosophical and historical issues and the implications they have for foundational studies. For the most part, the author assumes little more than a familiarity with logic comparable to that provided in a beginning graduate course which includes the incompleteness of arithmetic and the Lowenheim-Skolem theorems. All those concerned with the foundations of mathematics will find this a thought-provoking discussion of some of the central issues in the field today.

The subject of this paper is the philosophical problem of accounting for the relationship between mathematics and non-mathematical reality. The first section, devoted to the importance of the problem, suggests that many of the reasons for engaging in philosophy at all make an account of the relationship between mathematics and reality a priority, not only in philosophy of mathematics and philosophy of science, but also in general epistemology/metaphysics. This is followed by a (rather brief) survey of the major, traditional philosophies of mathematics indicating how each is prepared to deal with the present problem. It is shown that (the standard formulations of) some views seem to deny outright that there is a relationship between mathematics and any non-mathematical reality; such philosophies are clearly unacceptable. Other views leave the relationship rather mysterious and, thus, are incomplete at best. The final, more speculative section provides the direction of a positive account. A structuralist philosophy of mathematics is outlined and it is proposed that mathematics applies to reality though the discovery of mathematical structures underlying the non-mathematical universe.

The is an old question over whether there is a substantial disagreement between advocates of different logics, as they simply attach different meanings to the crucial logical terminology. The purpose of this article is to revisit this old question in light a pluralism/relativism that regards the various logics as equally legitimate, in their own contexts. We thereby address the vexed notion of translation, as it occurs between mathematical theories. We articulate and defend a thesis that the notion of “same meaning” is itself context-sensitive, depending on the purposes of a given conversation.

SummaryAccording to Dummett's understanding of Frege, the sense of a denoting expression is a procedure for determining its denotation. The purpose of this article is to pursue this suggestion and develop a semi‐formal interpretation of Fregean sense for the special case of a first‐order language of arithmetic. In particular, we define the sense of each arithmetic expression to be a hypothetical process to determine the denoted number or truth value. The sense‐process is “hypothetical” in that the senses of some expressions cannot be completed in a finite number of steps. The motivation for this work is to explicate an intensional notion of effectiveness in terms of the senses of function names. It is proposed, in particular, that an expression is effective if and only if its sense can be completed in a finite number of steps. It is shown that a function is computable if and only if it has an effective name.RésuméSelon la lecture que Dummet donne de Frege, le sens ?on;une expression consiste en une procédure pour déterminer sa dénotation. Le but de cet article est de développer cette suggestion par une interprétation semi‐formelle du sens frégéen dans le cas particulier ?on;un langage de premier ordre en arithmétique. En particulier, nous définissons comme sens de toute expression mathématique un procédé hypothétique pour déterminer le nombre dénoté ou la valeur de vérité. Le procédé créateur de sens est hypothetique en ce sens que les sens de certaines expressions ne peuvent pas être donnés en un nombre fini de pas. Le but de cette étude est ?on;expliciter une notion intensionnelle ?on;effectuabilite en termes de sens des noms de fonction. II est en particulier propose qu'une expression soit dite effectuable si et seulement si son sens peut être épuisé en un nombre fini de pas. On montre qu'une fonction est calculable si et seulement si elle a un nom effectuable.ZusammenfassungDummets Auffassung von Frege gemäss besteht der Sinn eines denotierenden Ausdruckes in einem Verfahren, das dessen Denotation bestimmt. Es ist der Zweck der vorliegenden Arbeit, die‐sen Vorschlag weiterzufuUhren und eine halbformale Interpretation des Fregeschen Sinnes fiir den besonderen Fall der Sprache erster Stufe der Arithmetik zu entwickeln. Es wird im besonderen der Sinn eines jeden arithmetischen Ausdruckes als hypothetisches Verfahren zur Bestimmung der denotierten Zahl oder des Wahrheitswertes definiert. Die Sinngebung ist insofern hypothe‐tisch, als der Sinn gewisser Ausdrucke nicht in einer endlichen Zahl von Schritten gegeben wer‐den kann. Das Anliegen der Arbeit grundet in der Absicht, einen intensionalen Begriff der Effek‐tivitat aufgrund des Sinnes von Funktionsnamen zu erlautern. Es wird im besonderen festgelegt, dass ein Ausdruck dann und nur dann effektiv sei, wenn sein Sinn in einer endlichen Zahl von Schritten erreicht werden kann. Es wird gezeigt, dass eine Funktion genau dann berechenbar ist, wenn sie einen effektiven Namen hat

Since virtually every mathematical theory can be interpreted in Zermelo-Fraenkel set theory, it is a foundation for mathematics. There are other foundations, such as alternate set theories, higher-order logic, ramified type theory, and category theory. Whether set theory is the right foundation for mathematics depends on what a foundation is for. One purpose is to provide the ultimate metaphysical basis for mathematics. A second is to assure the basic epistemological coherence of all mathematical knowledge. A third is to serve mathematics, by lending insight into the various fields and suggesting fruitful techniques of research. A fourth purpose of a foundation is to provide an arena for exploring relations and interactions between mathematical fields. While set theory does better with regard to some of these and worse with regard to others, it has become the de facto arena for deciding questions of existence, something one might expect of a foundation. Given the different goals, there is little point to determining a single foundation for all of mathematics.

Some authors have claimed that ante rem structuralism has problems with structures that have indiscernible places. In response, I argue that there is no requirement that mathematical objects be individuated in a non-trivial way. Metaphysical principles and intuitions to the contrary do not stand up to ordinary mathematical practice, which presupposes an identity relation that, in a sense, cannot be defined. In complex analysis, the two square roots of –1 are indiscernible: anything true of one of them is true of the other. I suggest that ‘i’ functions like a parameter in natural deduction systems. I gave an early version of this paper at a workshop on structuralism in mathematics and science, held in the Autumn of 2006, at Bristol University. Thanks to the organizers, particularly Hannes Leitgeb, James Ladyman, and Øystein Linnebo, to my commentator Richard Pettigrew, and to the audience there. The paper also benefited considerably from a preliminary session at the Arché Research Centre at the University of St Andrews. I am indebted to my colleagues Craige Roberts, for help with the linguistics literature, and Ben Caplan and Gabriel Uzquiano, for help with the metaphysics. Thanks also to Hannes Leitgeb and Jeffrey Ketland for reading an earlier version of the manuscript and making helpful suggestions. I also benefited from conversations with Richard Heck, John Mayberry, Kevin Scharp, and Jason Stanley. CiteULike    Connotea    Del.icio.us    What's this?

The idea that logic and reasoning are somehow related goes back to antiquity. It clearly underlies much of the work in logic, as witnessed by the development of computability, and formal and mechanical deductive systems, for example. On the other hand, a platitude is that logic is the study of correct reasoning; and reasoning is cognitive if anything Is. Thus, the relationship between logic, computation, and correct reasoning makes an interesting and historically central case study for mechanism. The purpose of this article is to begin the articulation of this relationship, pointing out its sources and its limitations.

At the beginning of Die Grundlagen der Arithmetik [1884], Frege observes that “it is in the nature of mathematics to prefer proof, where proof is possible”. This, of course, is true, but thinkers differ on why it is that mathematicians prefer proof. And what of propositions for which no proof is possible? What of axioms? This talk explores various notions of self-evidence, and the role they play in various foundational systems, notably those of Frege and Zermelo. I argue that both programs are undermined at a crucial point, namely when self-evidence is supported by holistic and even pragmatic considerations.

There are a number of regions-based accounts of space/time, due to Whitehead, Roeper, Menger, Tarski, the present authors, and others. They all follow the Aristotelian theme that continua are not composed of points: each region has a proper part. The purpose of this note is to show how to recapture ‘points’ in such frameworks via Scottish neo-logicist abstraction principles. The results recapitulate some Aristotelian themes. A second agenda is to provide a new arena to help decide what is at stake when adjudicating issues concerning the identity of neo-logicist abstracts — so-called ‘Caesar questions’.

Sections 3.16 and 3.23 of Roger Penrose's Shadows of the mind (Oxford, Oxford University Press, 1994) contain a subtle and intriguing new argument against mechanism, the thesis that the human mind can be accurately modeled by a Turing machine. The argument, based on the incompleteness theorem, is designed to meet standard objections to the original Lucas-Penrose formulations. The new argument, however, seems to invoke an unrestricted truth predicate (and an unrestricted knowability predicate). If so, its premises are inconsistent. The usual ways of restricting the predicates either invalidate Penrose's reasoning or require presuppositions that the mechanist can reject

There is a parallel between the debate between Gottlob Frege and David Hilbert at the turn of the twentieth century and at least some aspects of the current controversy over whether category theory provides the proper framework for structuralism in the philosophy of mathematics. The main issue, I think, concerns the place and interpretation of meta-mathematics in an algebraic or structuralist approach to mathematics. Can meta-mathematics itself be understood in algebraic or structural terms? Or is it an exception to the slogan that mathematics is the science of structure?

We examine George Boolos's proposed abstraction principle for extensions based on the limitation-of-size conception, New V, from several perspectives. Crispin Wright once suggested that New V could serve as part of a neo-logicist development of real analysis. We show that it fails both of the conservativeness criteria for abstraction principles that Wright proposes. Thus, we support Boolos against Wright. We also show that, when combined with the axioms for Boolos's iterative notion of set, New V yields a system equivalent to full Zermelo-Fraenkel set theory with a principle of global choice. This advances Boolos's longstanding interest in the foundations of set theory.