In “Models and Reality” (1980), Putnam sketched a version of his internal realism as it might arise in the philosophy of mathematics. Here, I will develop that sketch. By combining Putnam’s model-theoretic arguments with Dummett’s reflections on Gödelian incompleteness, we arrive at (what I call) the Skolem-Gödel Antinomy. In brief: our mathematical concepts are perfectly precise; however, these perfectly precise mathematical concepts are manifested and acquired via a formal theory, which is understood in terms of a computable system of proof, (...) and hence is incomplete. Whilst this might initially seem strange, I show how internal categoricity results for arithmetic and set theory allow us to face up to this Antinomy. This also allows us to understand why “Models are not lost noumenal waifs looking for someone to name them,” but “constructions within our theory itself,” with “names from birth.”. (shrink)

We study reflection principles in Kelley-Morse set theory with urelements (KMU). We first show that First-Order Reflection Principle is not provable in KMU with Global Choice. We then show that KMU + Limitation of Size + Second-Order Reflection Principle is mutually interpretable with KM + Second-Order Reflection Principle. Furthermore, these two theories are also shown to be bi-interpretable with parameters. Finally, assuming the existence of a κ+-supercompact cardinal κ in KMU, we construct a model of KMU + Second-Order Reflection Principle (...) where Limitation of Size fails. (shrink)

Orthodoxy holds that there is a determinate fact of the matter about every arithmetical claim. Little argument has been supplied in favour of orthodoxy, and work of Field, Warren and Waxman, and others suggests that the presumption in its favour is unjustified. This paper supports orthodoxy by establishing the determinacy of arithmetic in a well-motivated modal plural logic. Recasting this result in higher-order logic reveals that even the nominalist who thinks that there are only finitely many things should think that (...) there is some sense in which arithmetic is true and determinate. (shrink)

On a widespread naturalist view, the meanings of mathematical terms are determined, and can only be determined, by the way we use mathematical language—in particular, by the basic mathematical principles we’re disposed to accept. But it’s mysterious how this can be so, since, as is well known, minimally strong first-order theories are non-categorical and so are compatible with countless non-isomorphic interpretations. As for second-order theories: though they typically enjoy categoricity results—for instance, Dedekind’s categoricity theorem for second-order and Zermelo’s quasi-categoricity theorem (...) for second-order —these results require full second-order logic. So appealing to these results seems only to push the problem back, since the principles of second-order logic are themselves non-categorical: those principles are compatible with restricted interpretations of the second-order quantifiers on which Dedekind’s and Zermelo’s results are no longer available. In this paper, we provide a naturalist-friendly, non-revisionary solution to an analogous but seemingly more basic problem—Carnap’s Categoricity Problem for propositional and first-order logic—and show that our solution generalizes, giving us full second-order logic and thereby securing the categoricity or quasi-categoricity of second-order mathematical theories. Briefly, the first-order quantifiers have their intended interpretation, we claim, because we’re disposed to follow the quantifier rules in an open-ended way. As we show, given this open-endedness, the interpretation of the quantifiers must be permutation-invariant and so, by a theorem recently proved by Bonnay and Westerståhl, must be the standard interpretation. Analogously for the second-order case: we prove, by generalizing Bonnay and Westerståhl’s theorem, that the permutation invariance of the interpretation of the second-order quantifiers, guaranteed once again by the open-endedness of our inferential dispositions, suffices to yield full second-order logic. (shrink)

The following bare-bones story introduces the idea of a cumulative hierarchy of pure sets: 'Sets are arranged in stages. Every set is found at some stage. At any stage S: for any sets found before S, we find a set whose members are exactly those sets. We find nothing else at S.' Surprisingly, this story already guarantees that the sets are arranged in well-ordered levels, and suffices for quasi-categoricity. I show this by presenting Level Theory, a simplification of set theories (...) due to Scott, Montague, Derrick, and Potter. (shrink)

It’s sometimes suggested that we can (in a sense) settle the truth-value of some statements in the language of number theory by stipulation, adopting either φ or ¬φ as an additional axiom. For example, in Clarke-Doane (2020b) and a series of recent APA presentations, Clarke-Doane suggests that any Σ01 sound expansion of our current arithmetical practice would express a truth. In this paper, I’ll argue that (given a certain popular assumption about the model-theoretic representability of languages like ours) we can’t (...) know ourselves to have any such freedom. (shrink)

Our relationship to the infinite is controversial. But it is widely agreed that our powers of reasoning are finite. I disagree with this consensus; I think that we can, and perhaps do, engage in infinite reasoning. Many think it is just obvious that we can't reason infinitely. This is mistaken. Infinite reasoning does not require constructing infinitely long proofs, nor would it gift us with non-recursive mental powers. To reason infinitely we only need an ability to perform infinite inferences. I (...) argue that we have this ability. My argument looks to our best current theories of inference and considers examples of apparent infinite reasoning. My position is controversial, but if I'm right, our theories of truth, mathematics, and beyond could be transformed. And even if I'm wrong, a more careful consideration of infinite reasoning can only deepen our understanding of thinking and reasoning. -/- (Note for readers: the paper's brief discussion of uniform reflection and omega inconsistency is misleading. The imagined interlocutor's argument makes an assumption about the PA-provability of provability generalizations that, while true for the Godel sentence's instances, is unjustified, in general. This means my position is stronger against this objection than the paper suggests, since omega inconsistent theories are not automatically inconsistent with their uniform reflection principles, you also need to assume the arithmetically true Pi-2 sentences.). (shrink)

What Bar-On and Simmons call 'Conceptual Deflationism' is the thesis that truth is a 'thin' concept in the sense that it is not suited to play any explanatory role in our scientific theorizing. One obvious place it might play such a role is in semantics, so disquotationalists have been widely concerned to argued that 'compositional principles', such as -/- (C) A conjunction is true iff its conjuncts are true -/- are ultimately quite trivial and, more generally, that semantic theorists have (...) misconceived the relation between truth, meaning, and logic. This paper argues, to the contrary, that even such simple compositional principles as (C) have substantial content that cannot be captured by deflationist 'proofs' of them. The key thought is that (C) is supposed, among other things, to affirm the truth-functionality of conjunction and that disquotationalists cannot, ultimately, make sense of truth-functionality. -/- This paper is something of a companion to "The Logical Strength of Compositional Principles". (shrink)

Informal rigour is the process by which we come to understand particular mathematical structures and then manifest this rigour through axiomatisations. Structural relativity is the idea that the kinds of structures we isolate are dependent upon the logic we employ. We bring together these ideas by considering the level of informal rigour exhibited by our set-theoretic discourse, and argue that different foundational programmes should countenance different underlying logics (intermediate between first- and second-order) for formulating set theory. By bringing considerations of (...) perturbations in modal space to bear on the debate, we will suggest that a promising option for representing current set-theoretic thought is given by formulating set theory using quasi-weak second-order logic. These observations indicate that the usual division of structures into \particular (e.g. the natural number structure) and general (e.g. the group structure) is perhaps too coarse grained; we should also make a distinction between intentionally and unintentionally general structures. (shrink)

Penelope Maddy has recently addressed the set-theoretic multiverse, and expressed reservations on its status and merits ([Maddy, 2017]). The purpose of the paper is to examine her concerns, by using the interpretative framework of set-theoretic naturalism. I first distinguish three main forms of 'multiversism', and then I proceed to analyse Maddy's concerns. Among other things, I take into account salient aspects of multiverse-related mathematics , in particular, research programmes in set theory for which the use of the multiverse seems to (...) be crucial, and show how one may provide responses to Maddy's concerns based on a careful analysis of 'multiverse practice'. (shrink)

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)

A prominent objection against the logicality of second-order logic is the so-called Overgeneration Argument. However, it is far from clear how this argument is to be understood. In the first part of the article, we examine the argument and locate its main source, namely, the alleged entanglement of second-order logic and mathematics. We then identify various reasons why the entanglement may be thought to be problematic. In the second part of the article, we take a metatheoretic perspective on the matter. (...) We prove a number of results establishing that the entanglement is sensitive to the kind of semantics used for second-order logic. These results provide evidence that by moving from the standard set-theoretic semantics for second-order logic to a semantics which makes use of higher-order resources, the entanglement either disappears or may no longer be in conflict with the logicality of second-order logic. (shrink)

ABSTRACTIn reply to Linnebo, I defend my analysis of Tait's argument against the use of classical logic in set theory, and make some preliminary comments on Linnebo's new argument for the same conclusion. I then turn to Shapiro's discussion of intuitionistic analysis and of Smooth Infinitesimal Analysis. I contend that we can make sense of intuitionistic analysis, but only by attaching deviant meanings to the connectives. Whether anyone can make sense of SIA is open to doubt: doing so would involve (...) making sense of mathematical quantities whose relationship to zero and to one another is inherently indeterminate. (shrink)

Set-theoretic and category-theoretic foundations represent different perspectives on mathematical subject matter. In particular, category-theoretic language focusses on properties that can be determined up to isomorphism within a category, whereas set theory admits of properties determined by the internal structure of the membership relation. Various objections have been raised against this aspect of set theory in the category-theoretic literature. In this article, we advocate a methodological pluralism concerning the two foundational languages, and provide a theory that fruitfully interrelates a `structural' perspective (...) to a set-theoretic one. We present a set-theoretic system that is able to talk about structures more naturally, and argue that it provides an important perspective on plausibly structural properties such as cardinality. We conclude the language of set theory can provide useful information about the notion of mathematical structure. (shrink)

ABSTRACT Historical structuralist views have been ontological. They either deny that there are any mathematical objects or they maintain that mathematical objects are structures or positions in them. Non-ontological structuralism offers no account of the nature of mathematical objects. My own structuralism has evolved from an early sui generis version to a non-ontological version that embraces Quine’s doctrine of ontological relativity. In this paper I further develop and explain this view.

Since Benacerraf’s ‘What Numbers Could Not Be, ’ there has been a growing interest in mathematical structuralism. An influential form of mathematical structuralism, modal structuralism, uses logical possibility and second order logic to provide paraphrases of mathematical statements which don’t quantify over mathematical objects. These modal structuralist paraphrases are a useful tool for nominalists and realists alike. But their use of second order logic and quantification into the logical possibility operator raises concerns. In this paper, I show that the work (...) of both these elements can be done by a single natural generalization of the logical possibility operator. (shrink)

Many philosophers believe that a deflationist theory of truth must conservatively extend any base theory to which it is added. But when applied to arithmetic, it's argued, the imposition of a conservativeness requirement leads to a serious objection to deflationism: for the Gödel sentence for Peano Arithmetic is not a theorem of PA, but becomes one when PA is extended by adding plausible principles governing truth. This paper argues that no such objection succeeds. The issue turns on how we understand (...) the notion of logical consequence implicit in any conservativeness requirement, and whether we possess a categorical conception of the natural numbers. I offer a disjunctive response: if we possess a categorical conception of arithmetic, then deflationists have principled reason to accept a rich notion of logical consequence according to which the Gödel sentence follows from PA. But if we do not, then the reasons for requiring the derivation of the Gödel sentence lapse, and deflationists are free to accept a conservativeness requirement stated proof-theoretically. Either way, deflationism is in the clear. (shrink)

This essay clarifies quantifier variance and uses it to provide a theory of indefinite extensibility that I call the variance theory of indefinite extensibility. The indefinite extensibility response to the set-theoretic paradoxes sees each argument for paradox as a demonstration that we have come to a different and more expansive understanding of ‘all sets’. But indefinite extensibility is philosophically puzzling: extant accounts are either metasemantically suspect in requiring mysterious mechanisms of domain expansion, or metaphysically suspect in requiring nonstandard assumptions about (...) mathematical objects. Happily, the view of quantifier meanings that underwrites quantifier variance can be used to provide an account of indefinite extensibility that is both metasemantically and metaphysically satisfying. Section 1 introduces the puzzle of indefinite extensibility; section 2 develops and clarifies the metasemantics of quantifier variance; section 3 solves section 1's puzzle of indefinite extensibility by applying section 2's account of quantifier meanings; and section 4 compares the theory developed in section 3 to several other theories in the literature. (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)

Multiverse Views in set theory advocate the claim that there are many universes of sets, no-one of which is canonical, and have risen to prominence over the last few years. One motivating factor is that such positions are often argued to account very elegantly for technical practice. While there is much discussion of the technical aspects of these views, in this paper I analyse a radical form of Multiversism on largely philosophical grounds. Of particular importance will be an account of (...) reference on the Multiversist conception, and the relativism that it implies. I argue that analysis of this central issue in the Philosophy of Mathematics indicates that Radical Multiversism must be algebraic, and cannot be viewed as an attempt to provide an account of reference without a softening of the position. (shrink)

In set theory, a maximality principle is a principle that asserts some maximality property of the universe of sets or some part thereof. Set theorists have formulated a variety of maximality principles in order to settle statements left undecided by current standard set theory. In addition, philosophers of mathematics have explored maximality principles whilst attempting to prove categoricity theorems for set theory or providing criteria for selecting foundational theories. This article reviews recent work concerned with the formulation, investigation and justification (...) of maximality principles. (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.

This essay is a study of ontological commitment, focused on the special case of arithmetical discourse. It tries to get clear about what would be involved in a defense of the claim that arithmetical assertions are ontologically innocent and about why ontological innocence matters. The essay proceeds by questioning traditional assumptions about the connection between the objects that are used to specify the truth-conditions of a sentence, on the one hand, and the objects whose existence is required in order for (...) the truth-conditions thereby specified to be satisfied, on the other. This allows one to set forth an assignment of truth-conditions to arithmetical sentences whereby nothing is required of the world in order for the truth-conditions of a truth of pure arithmetic to be satisfied. The essay then argues that such an assignment can be used to account for the a priori knowability of certain arithmetical truths. (shrink)

A pervasive thought in contemporary philosophy of mathematics is that in order to justify reflection principles, one must hold universism: the view that there is a single universe of pure sets. I challenge this kind of reasoning by contrasting universism with a Zermelian form of multiversism. I argue that if extant justifications of reflection principles using notions of richness are acceptable for the universist, then the Zermelian can use similar justifications. However, I note that for some forms of richness argument, (...) the status of reflection principles as axioms is left open for the Zermelian. (shrink)

This paper raises the question under what circumstances a plurality forms a set, parallel to the Special Composition Question for mereology. The range of answers that have been proposed in the literature are surveyed and criticised. I argue that there is good reason to reject both the view that pluralities never form sets and the view that pluralities always form sets. Instead, we need to affirm restricted set formation. Casting doubt on the availability of any informative principle which will settle (...) which pluralities form sets, the paper concludes by affirming a naturalistic approach to the philosophy of set theory. (shrink)

Proof-theoretic reflection principles are schemas which attempt to express the soundness of arithmetical theories within their own language, e.g., ${\mathtt{{Prov}_{\mathsf {PA}} \rightarrow \varphi }}$ can be understood to assert that any statement provable in Peano arithmetic is true. It has been repeatedly suggested that justification for such principles follows directly from acceptance of an arithmetical theory $\mathsf {T}$ or indirectly in virtue of their derivability in certain truth-theoretic extensions thereof. This paper challenges this consensus by exploring relationships between reflection principles (...) and principles of mathematical and transfinite induction as well as the status of the latter with respect to various foundational characterizations of number theory. (shrink)

Languages involving modalities and languages involving vagueness have each been thoroughly studied. On the other hand, virtually nothing has been said about the interaction of modality and vagueness. This paper aims to start filling that gap. Section 1 is a discussion of various possible sources of vague modality. Section 2 puts forward a model theory for a quantified language with operators for modality and vagueness. The model theory is followed by a discussion of the resulting logic. In Section 3, the (...) framework will permit us to address a puzzle raised by Elizabeth Barnes and Robert Williams. (shrink)

Following recent developments in the literature on axiomatic theories of truth, we investigate an alternative to the widespread habit of formalizing the syntax of the object-language into the object-language itself. We first argue for the proposed revision, elaborating philosophical evidences in favor of it. Secondly, we present a general framework for axiomatic theories of truth with theories of syntax. Different choices of the object theory O will be considered. Moreover, some strengthenings of these theories will be introduced: we will consider (...) extending the theories by the addition of coding axioms or by extending the schemas of O, if present, to the entire vocabulary of our theory of truth. Finally, we touch on the philosophical consequences that the theories described can have on the debate about the metaphysical status of the truth predicate and on the formalization of our informal metatheoretic reasoning. (shrink)

Gödel claimed that Zermelo-Fraenkel set theory is 'what becomes of the theory of types if certain superfluous restrictions are removed'. The aim of this paper is to develop a clearer understanding of Gödel's remark, and of the surrounding philosophical terrain. In connection with this, we discuss some technical issues concerning infinitary type theories and the programme of developing the semantics for higher-order languages in other higher-order languages.

This article investigates the claim that some truths are fundamentally or really true — and that other truths are not. Such a distinction can help us reconcile radically minimal metaphysical views with the verities of common sense. I develop an understanding of the distinction whereby Fundamentality is not itself a metaphysical distinction, but rather a device that must be presupposed to express metaphysical distinctions. Drawing on recent work by Rayo on anti-Quinean theories of ontological commitments, I formulate a rigourous theory (...) of the notion. In the final sections, I show how this package dovetails with ' interpretationist' theories of meaning to give sober content to thought that some things — perhaps sets, or gerrymandered mereological sums — can be 'postulated into existence'. (shrink)

This thesis articulates the resonances between J. M. Coetzee's lifelong engagement with mathematics and his practice as a novelist, critic, and poet. Though the critical discourse surrounding Coetzee's literary work continues to flourish, and though the basic details of his background in mathematics are now widely acknowledged, his inheritance from that background has not yet been the subject of a comprehensive and mathematically- literate account. In providing such an account, I propose that these two strands of his intellectual trajectory not (...) only developed in parallel, but together engendered several of the characteristic qualities of his finest work. The structure of the thesis is essentially thematic, but is also broadly chronological. Chapter 1 focuses on Coetzee's poetry, charting the increasing involvement of mathematical concepts and methods in his practice and poetics between 1958 and 1979. Chapter 2 situates his master's thesis alongside archival materials from the early stages of his academic career, and thus traces the development of his philosophical interest in the migration of quantificatory metaphors into other conceptual domains. Concentrating on his doctoral thesis and a series of contemporaneous reviews, essays, and lecture notes, Chapter 3 details the calculated ambivalence with which he therein articulates, adopts, and challenges various statistical methods designed to disclose objective truth. Chapter 4 explores the thematisation of several mathematical concepts in Dusklands and In the Heart of the Country. Chapter Five considers Waiting for the Barbarians and Foe in the context provided by Coetzee's interest in the attempts of Isaac Newton to bridge the gap between natural language and the supposedly transparent language of mathematics. Finally, Chapter 6 locates in Elizabeth Costello and Diary of a Bad Year a cognitive approach to the use of mathematical concepts in ethics, politics, and aesthetics, and, by analogy, a central aspect of the challenge Coetzee's late fiction poses to the contemporary literary landscape. (shrink)

What is mathematics about? And if it is about some sort of mathematical reality, how can we have access to it? This is the problem raised by Plato, which still today is the subject of lively philosophical disputes. This book traces the history of the problem, from its origins to its contemporary treatment. It discusses the answers given by Aristotle, Proclus and Kant, through Frege's and Russell's versions of logicism, Hilbert's formalism, Gödel's platonism, up to the the current debate on (...) Benacerraf's dilemma and the indispensability argument. Through the considerations of themes in the philosophy of language, ontology, and the philosophy of science, the book aims at offering an historically-informed introduction to the philosophy of mathematics, approached through the lenses of its most fundamental problem. (shrink)

We look at recent accounts of the indefinite extensibility of the concept set and compare them with a certain linguistic model of indefinite extensibility. We suggest that the linguistic model has much to recommend over alternative accounts of indefinite extensibility, and we defend it against three prima facie objections.

This paper sketches an answer to the question how we, in our arithmetical practice, succeed in singling out the natural-number structure as our intended interpretation. It is argued that we bring this about by a combination of what we assert about the natural-number structure on the one hand, and our computational capacities on the other hand.

This paper develops a new framework for combining propositional logics, called "juxtaposition". Several general metalogical theorems are proved concerning the combination of logics by juxtaposition. In particular, it is shown that under reasonable conditions, juxtaposition preserves strong soundness. Under reasonable conditions, the juxtaposition of two consequence relations is a conservative extension of each of them. A general strong completeness result is proved. The paper then examines the philosophically important case of the combination of classical and intuitionist logics. Particular attention is (...) paid to the phenomenon of collapse. It is shown that there are logics with two stocks of classical or intuitionist connectives that do not collapse. Finally, the paper briefy investigates the question of which rules, when added to these logics, lead to collapse. (shrink)

We argue that certain modal questions raise serious problems for a modal metaphysics on which we are permitted to quantify unrestrictedly over all possibilia. In particular, we argue that, on reasonable assumptions, both David Lewis's modal realism and Timothy Williamson's necessitism are saddled with the remarkable conclusion that there is some cardinal number of the form ℵα such that there could not be more than ℵα-many angels in existence. In the last section, we make use of similar ideas to draw (...) a moral for a recent debate in meta-ontology. (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)

A number of authors have objected to the application of non-classical logic to problems in philosophy on the basis that these non-classical logics are usually characterised by a classical metatheory. In many cases the problem amounts to more than just a discrepancy; the very phenomena responsible for non-classicality occur in the field of semantics as much as they do elsewhere. The phenomena of higher order vagueness and the revenge liar are just two such examples. The aim of this paper is (...) to show that a large class of non-classical logics are strong enough to formulate their own model theory in a corresponding non-classical set theory. Specifically I show that adequate definitions of validity can be given for the propositional calculus in such a way that the metatheory proves, in the specified logic, that every theorem of the propositional fragment of that logic is validated. It is shown that in some cases it may fail to be a classical matter whether a given sentence is valid or not. One surprising conclusion for non-classical accounts of vagueness is drawn: there can be no axiomatic, and therefore precise, system which is determinately sound and complete. (shrink)

One of the philosophical uses of Dedekind’s categoricity theorem for Peano Arithmetic is to provide support for semantic realism. To this end, the logical framework in which the proof of the theorem is conducted becomes highly significant. I examine different proposals regarding these logical frameworks and focus on the philosophical benefits of adopting open-ended schemas in contrast to second order logic as the logical medium of the proof. I investigate Pederson and Rossberg’s critique of the ontological advantages of open-ended arithmetic (...) when it comes to establishing the categoricity of Peano Arithmetic and show that the critique is highly problematic. I argue that Pederson and Rossberg’s ontological criterion deliver the bizarre result that certain first order subsystems of Peano Arithmetic have a second order ontology. As a consequence, the application of the ontological criterion proposed by Pederson and Rossberg assigns a certain type of ontology to a theory, and a different, richer, ontology to one of its subtheories. (shrink)

Leon Horsten has recently claimed that the class of mathematical truths coincides with the class of theorems of ZFC. I argue that the naturalistic character of Horsten’s proposal undermines his contention that this claim constitutes an analogue of a thesis that Daniel Isaacson has advanced for PA. I argue, moreover, that Horsten’s defence of his claim against an obvious objection makes use of a distinction which is not available to him given his naturalistic approach. I suggest a way out of (...) the objection which is in line with the naturalistic spirit of Horsten’s proposal but which further weakens the analogy with Isaacson’s Thesis. I conclude by evaluating the prospects for providing an analogue of Isaacson’s Thesis for ZFC. (shrink)

There is little doubt that a second-order axiomatization of Zermelo-Fraenkel set theory plus the axiom of choice (ZFC) is desirable. One advantage of such an axiomatization is that it permits us to express the principles underlying the first-order schemata of separation and replacement. Another is its almost-categoricity: M is a model of second-order ZFC if and only if it is isomorphic to a model of the form Vκ, ∈ ∩ (Vκ × Vκ) , for κ a strongly inaccessible ordinal.

Might it be that world itself, independently of what we know about it or how we represent it, is metaphysically indeterminate? This article tackles in turn a series of questions: In what sorts of cases might we posit metaphysical indeterminacy? What is it for a given case of indefiniteness to be 'metaphysical'? How does the phenomenon relate to 'ontic vagueness', the existence of 'vague objects', 'de re indeterminacy' and the like? How might the logic work? Are there reasons for postulating (...) this distinctive sort of indefiniteness? Conversely, are there reasons for denying that there is indefiniteness of this sort? (shrink)

If mathematics is regarded as a science, then the philosophy of mathematics can be regarded as a branch of the philosophy of science, next to disciplines such as the philosophy of physics and the philosophy of biology. However, because of its subject matter, the philosophy of mathematics occupies a special place in the philosophy of science. Whereas the natural sciences investigate entities that are located in space and time, it is not at all obvious that this is also the case (...) with respect to the objects that are studied in mathematics. In addition to that, the methods of investigation of mathematics differ markedly from the methods of investigation in the natural sciences. Whereas the latter acquire general knowledge using inductive methods, mathematical knowledge appears to be acquired in a different way, namely, by deduction from basic principles. The status of mathematical knowledge also appears to differ from the status of knowledge in the natural sciences. The theories of the natural sciences appear to be less certain and more open to revision than mathematical theories. For these reasons mathematics poses problems of a quite distinctive kind for philosophy. Therefore philosophers have accorded special attention to ontological and epistemological questions concerning mathematics. (shrink)

It has been known for a few years that no more than Pi-1-1 comprehension is needed for the proof of "Frege's Theorem". One can at least imagine a view that would regard Pi-1-1 comprehension axioms as logical truths but deny that status to any that are more complex—a view that would, in particular, deny that full second-order logic deserves the name. Such a view would serve the purposes of neo-logicists. It is, in fact, no part of my view that, say, (...) Delta-3-1 comprehension axioms are not logical truths. What I am going to suggest, however, is that there is a special case to be made on behalf of Pi-1-1 comprehension. Making the case involves investigating extensions of first-order logic that do not rely upon the presence of second-order quantifiers. A formal system for so-called "ancestral logic" is developed, and it is then extended to yield what I call "Arché logic". (shrink)

According to the species of neo-logicism advanced by Hale and Wright, mathematical knowledge is essentially logical knowledge. Their view is found to be best understood as a set of related though independent theses: (1) neo-fregeanism-a general conception of the relation between language and reality; (2) the method of abstraction-a particular method for introducing concepts into language; (3) the scope of logic-second-order logic is logic. The criticisms of Boolos, Dummett, Field and Quine (amongst others) of these theses are explicated and assessed. (...) The issues discussed include reductionism, rejectionism, the Julius Caesar problem, the Bad Company objections, and the charge that second-order logic is set theory in disguise. (shrink)

Two models of second-order ZFC need not be isomorphic to each other, but at least one is isomorphic to an initial segment of the other. The situation is subtler for impure set theory, but Vann McGee has recently proved a categoricity result for second-order ZFCU plus the axiom that the urelements form a set. Two models of this theory with the same universe of discourse need not be isomorphic to each other, but the pure sets of one are isomorphic to (...) the pure sets of the other. This paper argues that similar results obtain for considerably weaker second-order axiomatizations of impure set theory that are in line with two different conceptions of set, the iterative conception and the limitation of size doctrine. (shrink)

I develop a technique for specifying truth-conditions.

Gödel argued that intuition has an important role to play in mathematical epistemology, and despite the infamy of his own position, this opinion still has much to recommend it. Intuitions and folk platitudes play a central role in philosophical enquiry too, and have recently been elevated to a central position in one project for understanding philosophical methodology: the so-called ‘Canberra Plan’. This philosophical role for intuitions suggests an analogous epistemology for some fundamental parts of mathematics, which casts a number of (...) themes in recent philosophy of mathematics (concerning a priority and fictionalism, for example) in revealing new light. (shrink)

The existence of non-standard models of first-order Peano-Arithmetic (PA) threatens to undermine the claim of the moderate mathematical realist that non-mysterious access to the natural number structure is possible on the basis of our best arithmetical theories. The move to logics stronger than FOL is denied to the moderate realist on the grounds that it merely shifts the indeterminacy “one level up” into the meta-theory by, illegitimately, assuming the determinacy of the notions needed to formulate such logics. This paper argues (...) that the challenge can be met. We show how the quantifier “there are infinitely many” can be uniquely determined in a naturalistically acceptable fashion and thus be used in the formulation of a theory of arithmetic. We compare the approach pursued here with Field’s justification of the same device and the popular strategy of invoking a second-order formalism, and argue that it is more robust than either of the alternative proposals. (shrink)