Stewart Shapiro

According to ante rem structuralism a branch of mathematics, such as arithmetic, is about a structure, or structures, that exist independent of the mathematician, and independent of any systems that exemplify the structure. A structure is a universal of sorts: structure is to exemplified system as property is to object. So ante rem structuralist is a form of ante rem realism concerning universals. Since the appearance of my Philosophy of mathematics: Structure and ontology, a number of criticisms of the idea of ante rem structures have appeared. Some argue that it is impossible to give identity conditions for places in homogeneous ante rem structures, invoking a version of the identity of indiscernibles. Others raise issues concerning the identity and distinctness of places in different structures, such as the the natural number 2 and the real number 2. The purpose of this paper is to take the measure of these objections, and to further articulate ante rem structuralism to take them into account.

§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.

There is an interesting logical/semantic issue with some mathematical languages and theories. In the language of (pure) complex analysis, the two square roots of i’ manage to pick out a unique object? This is perhaps the most prominent example of the phenomenon, but there are some others. The issue is related to matters concerning the use of definite descriptions and singular pronouns, such as donkey anaphora and the problem of indistinguishable participants. Taking a cue from some work in linguistics and the philosophy of language, I suggest that i functions like a parameter in natural deduction systems. This may require some rethinking of the role of singular terms, at least in mathematical languages

We develop a point-free construction of the classical one- dimensional continuum, with an interval structure based on mereology and either a weak set theory or logic of plural quantification. In some respects this realizes ideas going back to Aristotle,although, unlike Aristotle, we make free use of classical "actual infinity". Also, in contrast to intuitionistic, Bishop, and smooth infinitesimal analysis, we follow classical analysis in allowing partitioning of our "gunky line" into mutually exclusive and exhaustive disjoint parts, thereby demonstrating the independence of "indecomposability" from a non-punctiform conception. It is surprising that such simple axioms as ours already imply the Archimedean property and that they determine an isomorphism with the Dedekind-Cantor structure of R as a complete, separable, ordered field. We also present some simple topological models of our system, establishing consistency relative to classical analysis. Finally, after describing how to nominalize our theory, we close with comparisons with earlier efforts related to our own.

Since virtually every mathematical theory can be interpreted in set theory, the latter is a foundation for mathematics. Whether set theory, as opposed to any of its rivals, is the right foundation for mathematics depends on what a foundation is for. One purpose is philosophical, to provide the metaphysical basis for mathematics. Another is epistemic, to provide the basis of all mathematical knowledge. Another is to serve mathematics, by lending insight into the various fields. Another is to provide an arena for exploring relations and interactions between mathematical fields, their relative strengths, etc. Given the different goals, there is little point to determining a single foundation for all of mathematics.

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

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.

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.

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.

Michael Lynch’s Truth as One and Many is a contribution to the large body of philosophical literature on the nature of truth. Within that genre, advocates of truth-as-correspondence, advocates of truth-as-coherence, and the like, all hold that truth has a single underlying metaphysical nature, but they sharply disagree as to what this nature is. Lynch argues that many of these views make good sense of truth attributions for a limited stretch of discourse, but he adds that each of the contenders also faces a ‘scope problem’, in that none of them makes sense of all legitimate truth attributions. Some deflationists make similar observations – usually less concessive – and conclude that truth simply has no substantial, underlying nature. There is nothing for the philosopher to articulate and defend. Lynch agrees with deflationists that the realm of discourse is too diverse for any single ‘first-level’ property, such as correspondence or coherence, to fully characterize it, but against deflationism, he holds that truth does have a nature. He presents a functionalist theory. The definition is this: x is true if, and only if, x has a property that plays the truth-role. According to Lynch, the truth-role is given in terms of what he calls the ‘core truisms’ of the folk concept of truth. These are platitudes that hold of the everyday notion, and are such that anyone who denies all of them can be accused of changing the subject – of not talking about truth. A given property T plays the truth-role for a batch of propositions, just in case, for any proposition P in the batch: P is T if, and only if, where P is believed, things are as they are believed to be; other things being equal, it is a worthy goal …