In 1999, Jeffrey Ketland published a paper which posed a series of technical problems for deflationary theories of truth. Ketland argued that deflationism is incompatible with standard mathematical formalizations of truth, and he claimed that alternate deflationary formalizations are unable to explain some central uses of the truth predicate in mathematics. He also used Beth’s definability theorem to argue that, contrary to deflationists’ claims, the T-schema cannot provide an ‘implicit definition’ of truth. In this article, I want to challenge this (...) final argument. Whatever other faults deflationism may have, the T-schema does provide an implicit definition of the truth predicate. Or so, at any rate, I shall argue. (shrink)

It has been argued that quantum mechanics forces us to accept the existence of metaphysical, mind-independent indeterminacy. In this paper we provide an interpretation of the indeterminacy involved in the quantum phenomena in terms of a view that we call Plural Metaphysical Supervaluationism. According to it, quantum indeterminacy is captured in terms of an irreducibly plural relation between the actual world and various misrepresentations of it.

This paper discusses the relevance of supertask computation for the determinacy of arithmetic. Recent work in the philosophy of physics has made plausible the possibility of supertask computers, capable of running through infinitely many individual computations in a finite time. A natural thought is that, if supertask computers are possible, this implies that arithmetical truth is determinate. In this paper we argue, via a careful analysis of putative arguments from supertask computations to determinacy, that this natural thought is mistaken: supertasks (...) are of no help in explaining arithmetical determinacy. (shrink)

This article offers an overview of inferential role semantics. We aim to provide a map of the terrain as well as challenging some of the inferentialist’s standard commitments. We begin by introducing inferentialism and placing it into the wider context of contemporary philosophy of language. §2 focuses on what is standardly considered both the most important test case for and the most natural application of inferential role semantics: the case of the logical constants. We discuss some of the (alleged) benefits (...) of logical inferentialism, chiefly with regards to the epistemology of logic, and consider a number of objections. §3 introduces and critically examines the most influential and most fully developed form of global inferentialism: Robert Brandom’s inferentialism about linguistic and conceptual content in general. Finally, in §4 we consider a number of general objections to IRS and consider possible responses on the inferentialist’s behalf. (shrink)

This article surveys recent literature by Parsons, McGee, Shapiro and others on the significance of categoricity arguments in the philosophy of mathematics. After discussing whether categoricity arguments are sufficient to secure reference to mathematical structures up to isomorphism, we assess what exactly is achieved by recent ‘internal’ renditions of the famous categoricity arguments for arithmetic and set theory.

Hilary Putnam’s BIV argument first occurred to him when ‘thinking about a theorem in modern logic, the “Skolem–Löwenheim Theorem”’ (Putnam 1981: 7). One of my aims in this paper is to explore the connection between the argument and the Theorem. But I also want to draw some further connections. In particular, I think that Putnam’s BIV argument provides us with an impressively versatile template for dealing with sceptical challenges. Indeed, this template allows us to unify some of Putnam’s most enduring (...) contributions to the realism/antirealism debate: his discussions of brains-in-vats, of Skolem’s Paradox, and of permutations. In all three cases, we have an argument which does not merely defeat the sceptic; it also shows us that we must reject some prima facie plausible philosophical picture. (shrink)

According to the received view, formalism – interpreted as the thesis that mathematical truth does not outrun the consequences of our maximal mathematical theory – has been refuted by Goedel's theorem. In support of this claim, proponents of the received view usually invoke an informal argument for the truth of the Goedel sentence, an argument which is supposed to reconstruct our reasoning in seeing its truth. Against this, Field has argued in a series of papers that the principles involved in (...) this argument – when applied to our maximal mathematical theory – are unsound. This paper defends the received view by showing that there is a way of seeing the truth of the Goedel sentence which is immune to Field's strategy. (shrink)

In this paper, we describe "metaphysical reductions", in which the well-defined terms and predicates of arbitrary mathematical theories are uniquely interpreted within an axiomatic, metaphysical theory of abstract objects. Once certain (constitutive) facts about a mathematical theory T have been added to the metaphysical theory of objects, theorems of the metaphysical theory yield both an analysis of the reference of the terms and predicates of T and an analysis of the truth of the sentences of T. The well-defined terms and (...) predicates of T are analyzed as denoting abstract objects and abstract relations, respectively, in the background metaphysics, and the sentences of T have a reading on which they are true. After the technical details are sketched, the paper concludes with some observations about the approach. One important observation concerns the fact that the proper axioms of the background theory abstract objects can be reformulated in a way that makes them sound more like logical axioms. Some philosophers have argued that we should accept (something like) them as being logical. (shrink)

Gideon Rosen, Brian Leiter, and Catarina Dutilh Novaes raise deep questions about the arguments in Morality and Mathematics (M&M). Their objections bear on practical deliberation, the formulation of mathematical pluralism, the problem of universals, the argument from moral disagreement, moral ‘perception’, the contingency of our mathematical practices, and the purpose of proof. In this response, I address their objections, and the broader issues that they raise.

Conventionalism about mathematics has much in common with two other views: fictionalism and the multiverse view (aka plenitudinous platonism). The three views may differ over the existence of mathematical objects, but they agree in rejecting a certain kind of objectivity claim about mathematics, advocating instead an extreme pluralism. The early parts of the paper will try to elucidate this anti‐objectivist position, and question whether conventionalism really offers a third form of it distinct from fictionalism and the multiverse view. The paper (...) then turns to anti‐objectivism about logic, and suggests that here too conventionalism offers no distinct alternative, and that there are limits on the extent of pluralism/anti‐objectivism. It also argues that these limits can't be used to argue for more extensive objectivity within mathematics, and also that they do allow for more limited pluralism within logic, e.g. as regards resolution of semantic and property‐theoretic paradoxes. (shrink)

Rudolf Carnap’s principle of tolerance states that there is no need to justify the adoption of a logic by philosophical means. Carnap uses the freedom provided by this principle in his philosophy of mathematics: he wants to capture the idea that mathematical truth is a matter of linguistic rules by relying on a strong metalanguage with infinitary inference rules. In this paper, I give a new interpretation of an argument by E. W. Beth, which shows that the principle of tolerance (...) does not suffice to remove all obstacles to the employment of infinitary rules. (shrink)

It is commonly held that the natural numbers sequence 0, 1, 2,... possesses a unique structure. Yet by a well known model theoretic argument, there exist non-standard models of the formal theory which is generally taken to axiomatize all of our practices and intentions pertaining to use of the term “natural number.” Despite the structural similarity of this argument to the influential set theoretic indeterminacy argument based on the downward L ̈owenheim-Skolem theorem, most theorists agree that the number theoretic version (...) does not have skeptical consequences about the reference of “natural number” analogous to the ‘relativity’ Skolem claimed pertains to notions such as “uncountable” and “cardinal.” In this paper I argue that recent proposals by Shapiro, Lavine, McGee and Field which aim to distinguish the number and set theoretic indeterminacy arguments by locating extra-mathematical constraints on the interpretation of our number theoretic vocabulary are inadequate. I then suggest that if we consider the manner in which the natural numbers figure in our computational practices – e.g. in characterizing how we compute sums and products or determine prime factorizations – it follows that our application of computational terms such as “computable function” and “tractable computational problem” indirectly uniquely determines their structure. (shrink)

Hartry Field has recently examined the question whether our logical and mathematical concepts are referentially indeterminate. In his view, (1) certain logical notions, such as second-order quantification, are indeterminate, but (2) important mathematical notions, such as the notion of finiteness, are not (they are determinate). In this paper, I assess Field's analysis, and argue that claims (1) and (2) turn out to be inconsistent. After all, given that the notion of finiteness can only be adequately characterized in pure secondorder logic, (...) if Field is right in claiming that second-order quantification is indeterminate (see (1)), it follows that finiteness is also indeterminate (contrary to (2)). After arguing that Field is committed to these claims, I provide a diagnosis of why this inconsistency emerged, and I suggest an alternative, consistent picture of the relationship between logical and mathematical indeterminacy. (shrink)

What are Carnap's views on the epistemology of mathematics? Did he believe in a priori justification, and if so, what is his account of it? One might think that such questions are misguided, since in the 1930s Carnap came to reject traditional epistemology as a confused mixture of logic and psychology. But things are not that simple. Drawing on recent work by Richardson and Uebel, I will show that Carnap's mature metaphilosophy leaves room for two distinct notions of a priori (...) justification: one propositional, the other doxastic. The latter is especially interesting since it comes closest to a traditional understanding of a priority. On the other hand, Carnap has little to say about doxastic justification in his writings. This lacuna can be filled by drawing on an unpublished exchange with Irving M. Copi. In it, so I will show, Carnap endorses the view that agents can come to know all mathematical truths a priori. This fact, so I will further argue, can be used to adjudicate a dispute between Ricketts and Friedman about the nature and viability of Carnap's philosophy of mathematics—specifically his reliance on infinitary methods. (shrink)

We investigate the form of mathematical structuralism that acknowledges the existence of structures and their distinctive structural elements. This form of structuralism has been subject to criticisms recently, and our view is that the problems raised are resolved by proper, mathematics-free theoretical foundations. Starting with an axiomatic theory of abstract objects, we identify a mathematical structure as an abstract object encoding the truths of a mathematical theory. From such foundations, we derive consequences that address the main questions and issues that (...) have arisen. Namely, elements of different structures are different. A structure and its elements ontologically depend on each other. There are no haecceities and each element of a structure must be discernible within the theory. These consequences are not developed piecemeal but rather follow from our definitions of basic structuralist concepts. (shrink)

Mathematical pluralism can take one of three forms: (1) every consistent mathematical theory consists of truths about its own domain of individuals and relations; (2) every mathematical theory, consistent or inconsistent, consists of truths about its own (possibly uninteresting) domain of individuals and relations; and (3) the principal philosophies of mathematics are each based upon an insight or truth about the nature of mathematics that can be validated. (1) includes the multiverse approach to set theory. (2) helps us to understand (...) the significance of the distinguished non‐logical individual and relation terms of even inconsistent theories. (3) is a metaphilosophical form of mathematical pluralism and hasn't been discussed in the literature. In what follows, I show how the analysis of theoretical mathematics in object theory exhibits all three forms of mathematical pluralism. (shrink)

We observe that Putnam’s model-theoretic argument against determinacy of the concept of second-order quantification or that of the set is harmless to the nominalist. It serves as a good motivation for the nominalist philosophy of mathematics. But in the end it can lead to a serious challenge to the nominalist account of mathematical objectivity if some minimal assumptions about the relation between mathematical objectivity and logical objectivity are made. We consider three strategies the nominalist might take to meet this challenge, (...) and we argue that all these strategies are untenable. (shrink)

This paper investigates the determinacy of mathematics. We begin by clarifying how we are understanding the notion of determinacy before turning to the questions of whether and how famous independence results bear on issues of determinacy in mathematics. From there, we pose a metasemantic challenge for those who believe that mathematical language is determinate, motivate two important constraints on attempts to meet our challenge, and then use these constraints to develop an argument against determinacy and discuss a particularly popular approach (...) to resolving indeterminacy, before offering some brief closing reflections. We believe our discussion poses a serious challenge for most philosophical theories of mathematics, since it puts considerable pressure on all views that accept a non-trivial amount of determinacy for even basic arithmetic. (shrink)

The view that mathematical objects are indefinite in nature is presented and defended, hi the first section, Field's argument for fictionalism, given in response to Benacerraf's problem of identification, is closely examined, and it is contended that platonists can solve the problem equally well if they take the view that mathematical objects are indefinite. In the second section, two general arguments against the intelligibility of objectual indefiniteness are shown erroneous, hi the final section, the view is compared to mathematical structuralism, (...) and it is shown that a version of structuralism should be understood as embracing the same view. (shrink)

. Remarkably, despite the tremendous success of axiomatic set-theory in mathematics, logic and meta-mathematics, e.g., model-theory, two philosophical worries about axiomatic set-theory as the adequate catch of the set-concept keep haunting it. Having dealt with one worry in a previous paper in this journal, we now fulfil a promise made there, namely to deal with the second worry. The second worry is the Skolem Paradox and its ensuing Skolemite skepticism. We present a comparatively novel and simple analysis of the argument (...) of the Skolemite skeptic, which will reveal a general assumption concerning the meaning of the set-concept (we call it Connexion M). We argue that the Skolemite skeptics argument is a petitio principii and that consequently we find ourselves in a dialectical situation of stalemate.Few (if any) working set-theoreticians feel a tension – let alone see a paradox – between, on the one hand, what the Löwenheim–Skolem theorems and related results seem to be telling us about the set-concept, and, on the other hand, their uncompromising and successful use of the set-concept and their continuing enthusiasm about it, in other words: their lack of skepticism about the set-concept. Further, most (if not all) working settheoreticians have a relaxed attitude towards the ubiquitous undecidability phenomenon in set-theory, rather than a worrying one. We argue these are genuine philosophical problems about the practice of set-theory. We propound solutions, which crucially involve a renunciation of Connexion M. This breaks the dialectical situation of stalemate against the Skolemite skeptic. (shrink)

Second-order axiomatizations of certain important mathematical theories—such as arithmetic and real analysis—can be shown to be categorical. Categoricity implies semantic completeness, and semantic completeness in turn implies determinacy of truth-value. Second-order axiomatizations are thus appealing to realists as they sometimes seem to offer support for the realist thesis that mathematical statements have determinate truth-values. The status of second-order logic is a controversial issue, however. Worries about ontological commitment have been influential in the debate. Recently, Vann McGee has argued that one (...) can get some of the technical advantages of second-order axiomatizations—categoricity, in particular—while walking free of worries about ontological commitment. In so arguing he appeals to the notion of an open-ended schema—a schema that holds no matter how the language of the relevant theory is extended. Contra McGee, we argue that second-order quantification and open-ended schemas are on a par when it comes to ontological commitment. (shrink)