Let me start with a well-known story. Kant held that logic and conceptual analysis alone cannot account for our knowledge of arithmetic: “however we might turn and twist our concepts, we could never, by the mere analysis of them, and without the aid of intuition, discover what is the sum [7+5]” (KrV, B16). Frege took himself to have shown that Kant was wrong about this. According to Frege’s logicist thesis, every arithmetical concept can be defined in purely logical terms, and (...) every theorem of arithmetic can be proved using only the basic laws of logic. Hence, Kant was wrong to think that our grasp of arithmetical concepts and our knowledge of arithmetical truth depend on an extralogical source—the pure intuition of time (Frege 1884, §89, §109). Arithmetic, properly understood, is just a part of logic. (shrink)

Neo-Fregeanism in the philosophy of mathematics consists of two main parts: the logicist thesis, that mathematics (or at least branches thereof, like arithmetic) all but reduce to logic, and the platonist thesis, that there are abstract, mathematical objects. I will here focus on the ontological thesis, platonism. Neo-Fregeanism has been widely discussed in recent years. Mostly the discussion has focused on issues specific to mathematics. I will here single out for special attention the view on ontology which underlies the neo-Fregeans’ (...) claims about mathematical objects, and discuss this view in a broader setting. (shrink)

NeoFregeanism is an intriguing but elusive philosophy of mathematical existence. At crucial points, it goes cryptic and metaphorical. I want to put forward an interpretation of neoFregeanism—perhaps not one that actual neoFregeans will embrace—that makes sense of much of what they say. NeoFregeans should embrace quantifier variance.

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)

This paper uses neo-Fregean-style abstraction principles to develop the integers from the natural numbers (assuming Hume’s principle), the rational numbers from the integers, and the real numbers from the rationals. The first two are first-order abstractions that treat pairs of numbers: (DIF) INT(a,b)=INT(c,d) ≡ (a+d)=(b+c). (QUOT) Q(m,n)=Q(p,q) ≡ (n=0 & q=0) ∨ (n≠0 & q≠0 & m⋅q=n⋅p). The development of the real numbers is an adaption of the Dedekind program involving “cuts” of rational numbers. Let P be a property (of (...) rational numbers) and r a rational number. Say that r is an upper bound of P, written P≤r, if for any rational number s, if Ps then either s<r or s=r. In other words, P≤r if r is greater than or equal to any rational number that P applies to. Consider the Cut Abstraction Principle: (CP) ∀P∀Q(C(P)=C(Q) ≡ ∀r(P≤r ≡ Q≤r)). In other words, the cut of P is identical to the cut of Q if and only if P and Q share all of their upper bounds. The axioms of second-order real analysis can be derived from (CP), just as the axioms of second-order Peano arithmetic can be derived from Hume’s principle. The paper raises some of the philosophical issues connected with the neo-Fregean program, using the above abstraction principles as case studies. (shrink)

On the neo-Fregean approach to the foundations of mathematics, elementary arithmetic is analytic in the sense that the addition of a principle wliich may be held to IMJ explanatory of the concept of cardinal number to a suitable second-order logical basis suffices for the derivation of its basic laws. This principle, now commonly called Hume's principle, is an example of a Fregean abstraction principle. In this paper, I assume the correctness of the neo-Fregean position on elementary aritlunetic and seek to (...) explain one way in which it may be extended to encompass the theory of real numbers, introducing the reals, by means of suitable further abstraction principles, as ratios of quantities. (shrink)

It is widely thought that the acceptability of an abstraction principle is a feature of the cardinalities at which it is satisfiable. This view is called into question by a recent observation by Richard Heck. We show that a fix proposed by Heck fails but we analyze the interesting idea on which it is based, namely that an acceptable abstraction has to “generate” the objects that it requires. We also correct and complete the classification of proposed criteria for acceptable abstraction.

Neo-Fregeans argue that substantial mathematics can be derived from a priori abstraction principles, Hume's Principle connecting numerical identities with one:one correspondences being a prominent example. The embarrassment of riches objection is that there is a plurality of consistent but pairwise inconsistent abstraction principles, thus not all consistent abstractions can be true. This paper considers and criticizes various further criteria on acceptable abstractions proposed by Wright settling on another one—stability—as the best bet for neo-Fregeans. However, an analogue of the embarrassment of (...) riches objection resurfaces in the metatheory and I conclude by arguing that the neo-Fregean program, at least insofar as it includes a platonistic ontology, is fatally wounded by it. (shrink)

Frege Arithmetic (FA) is the second-order theory whose sole non-logical axiom is Hume’s Principle, which says that the number of F s is identical to the number of Gs if and only if the F s and the Gs can be one-to-one correlated. According to Frege’s Theorem, FA and some natural definitions imply all of second-order Peano Arithmetic. This paper distinguishes two dimensions of impredicativity involved in FA—one having to do with Hume’s Principle, the other, with the underlying second-order logic—and (...) investigates how much of Frege’s Theorem goes through in various partially predicative fragments of FA. Theorem 1 shows that almost everything goes through, the most important exception being the axiom that every natural number has a successor. Theorem 2 shows that the Successor Axiom cannot be proved in the theories that are predicative in either dimension. (shrink)

The neo-Fregean project of basing mathematics on abstraction principles faces “the bad company problem,” namely that a great variety of unacceptable abstraction principles are mixed in among the acceptable ones. In this paper I propose a new solution to the problem, based on the idea that individuation must take the form of a well-founded process. A surprising aspect of this solution is that every form of abstraction on concepts is permissible and that paradox is instead avoided by restricting what concepts (...) there are. (shrink)

This book investigates Aristotle’s views on abstraction and explores how he uses it. In this work, the author follows Aristotle in focusing on the scientific detail first and then approaches the metaphysical claims, and so creates a reconstructed theory that explains many puzzles of Aristotle’s thought. Understanding the details of his theory of relations and abstraction further illuminates his theory of universals. Some of the features of Aristotle’s theory of abstraction developed in this book include: abstraction is a relation; perception (...) and knowledge are types of abstraction; the objects generated by abstractions are relata which can serve as subjects in their own right, whereupon they can appear as items in other categories. The author goes on to look at how Aristotle distinguishes the concrete from the abstract paronym, how induction is a type of abstraction which typically moves from the perceived individuals to universals and how Aristotle’s metaphysical vocabulary is "relational.’ Beyond those features, this work also looks at how of universals, accidents, forms, causes and potentialities have being only as abstract aspects of individual substances. An individual substance is identical to its essence; the essence has universal features but is the singularity making the individual substance what it is. These theories are expounded within this book. One main attraction in working out the details of Aristotle’s views on abstraction lies in understanding his metaphysics of universals as abstract objects. This work reclaims past ground as the main philosophical tradition of abstraction has been ignored in recent times. It gives a modern version of the medieval doctrine of the threefold distinction of essence, made famous by the Islamic philosopher, Avicenna. (shrink)

Neologicists have sought to ground mathematical knowledge in abstraction. One especially obstinate problem for this account is the bad company problem. The leading neologicist strategy for resolving this problem is to attempt to sift the good abstraction principles from the bad. This response faces a dilemma: the system of ‘good’ abstraction principles either falls foul of the Scylla of inconsistency or the Charybdis of being unable to recover a modest portion of Zermelo–Fraenkel set theory with its intended generality. This article (...) argues that the bad company problem is due to the ‘static’ character of abstraction on the neologicist's account and develops a ‘dynamic’ account of abstraction that avoids both horns of the dilemma. 1 Introduction2ion Reconstructed3 From Bad to Worse4 Abstraction Reconceived5 Bad Company Made GoodA AppendixA.1SemanticsA.2LogicA.3ConsistencyA.4Strength. (shrink)

The existence of mereological sums can be derived from an abstraction principle in a way analogous to numbers. I draw lessons for the thesis that “composition is innocent” from neo-Fregeanism in the philosophy of mathematics.

This paper develops a novel theory of abstraction—what we call collective abstraction. The theory solves a notorious problem for noneliminative structuralism. The noneliminative structuralist holds that in addition to various isomorphic systems there is a pure structure that can be abstracted from each of these systems; but existing accounts of abstraction fail for nonrigid systems like the complex numbers. The problem with the existing accounts is that they attempt to define a unique abstraction operation. The theory of collective abstraction instead (...) simultaneously defines a collection of distinct abstraction operations, each of which maps a system to its corresponding pure structure. The theory is precisely formulated in an essentialist language. This allows us to throw new light on the question to what extent structuralists are committed to symmetric dependence. Finally, we apply the theory of collective abstraction to solve a problem about converse relations. (shrink)

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)

Neofregeanism and structuralism are among the most promising recent approaches to the philosophy of mathematics. Yet both have serious costs. We develop a view, structuralist neologicism, which retains the central advantages of each while avoiding their more serious costs. The key to our approach is using arbitrary reference to explicate how mathematical terms, introduced by abstraction principles, refer. Focusing on numerical terms, this allows us to treat abstraction principles as implicit definitions determining all properties of the numbers, achieving a key (...) neofregean advantage, while preserving the key structuralist advantage, which objects play the number role does not matter. (shrink)

A co-authored article with Roy T. Cook forthcoming in a special edition on the Caesar Problem of the journal Dialectica. We argue against the appeal to equivalence classes in resolving the Caesar Problem.

Neo-Fregean logicists claim that Hume’s Principle (HP) may be taken as an implicit definition of cardinal number, true simply by fiat. A long-standing problem for neo-Fregean logicism is that HP is not deductively conservative over pure axiomatic second-order logic. This seems to preclude HP from being true by fiat. In this paper, we study Richard Kimberly Heck’s Two-Sorted Frege Arithmetic (2FA), a variation on HP which has been thought to be deductively conservative over second-order logic. We show that it isn’t. (...) In fact, 2FA is not conservative over n-th order logic, for all $n \geq 2$. It follows that in the usual one-sorted setting, HP is not deductively Field-conservative over second- or higher-order logic. (shrink)

I argue that we can and should extend Tarski's model-theoretic criterion of logicality to cover indefinite expressions like Hilbert's ɛ operator, Russell's indefinite description operator η, and abstraction operators like 'the number of'. I draw on this extension to discuss the logical status of both abstraction operators and abstraction principles.

In this paper, we investigate (1) what can be salvaged from the original project of "logicism" and (2) what is the best that can be done if we lower our sights a bit. Logicism is the view that "mathematics is reducible to logic alone", and there are a variety of reasons why it was a non-starter. We consider the various ways of weakening this claim so as to produce a "neologicism". Three ways are discussed: (1) expand the conception of logic (...) used in the reduction, (2) allow the addition of analytic-sounding principles to logic so that the reduction is not to "logic alone" but to logic and truths knowable a priori, and (3) revise the conception of "reducible". We show how the current versions of neologicism fit into this classification scheme, and then focus on a kind of neologicism which we take to have the most potential for achieving the epistemological goals of the original logicist project. We argue that that the "weaker" the form of neologicism, the more likely it is to be a new form of logicism, and show how our preferred system, though mathematically weak, is metaphysically and epistemogically strong, and can "reduce" arbitrary mathematical theories to logic and analytic truths, if given a legitimate new sense of "reduction". (shrink)

This essay concerns the question of how we make genuine epistemic progress through conceptual analysis. Our way into this issue will be through consideration of the paradox of analysis. The paradox challenges us to explain how a given statement can make a substantive contribution to our knowledge, even while it purports merely to make explicit what one’s grasp of the concept under scrutiny consists in. The paradox is often treated primarily as a semantic puzzle. However, in “Sect. 1” I argue (...) that the paradox raises a more fundamental epistemic problem, and in “Sects.1 and 2” I argue that semantic proposals—even ones designed to capture the Fregean link between meaning and epistemic significance—fail to resolve that problem. Seeing our way towards a real solution to the paradox requires more than semantics; we also need to understand how the process of analysis can yield justification for accepting a candidate conceptual analysis. I present an account of this process, and explain how it resolves the paradox, in “Sect. 3”. I conclude in “Sect. 4” by considering the implications for the present account concerning the goal of conceptual analysis, and by arguing that the apparent scarcity of short and finite illuminating analyses in philosophically interesting cases provides no grounds for pessimism concerning the possibility of philosophical progress through conceptual analysis. (shrink)

This paper extracts some of the main theses in the philosophy of mathematics from my book, The Construction of Logical Space. I show that there are important limits to the availability of nominalistic paraphrase functions for mathematical languages, and suggest a way around the problem by developing a method for specifying nominalistic contents without corresponding nominalistic paraphrases. Although much of the material in this paper is drawn from the book — and from an earlier paper — I hope the present (...) discussion will earn its keep by motivating the ideas in a new way, and by suggesting further applications. (shrink)

One of the main problems plaguing neo-logicism is the Bad Company challenge: the need for a well-motivated account of which abstraction principles provide legitimate definitions of mathematical concepts. In this article a solution to the Bad Company challenge is provided, based on the idea that definitions ought to be conservative. Although the standard formulation of conservativeness is not sufficient for acceptability, since there are conservative but pairwise incompatible abstraction principles, a stronger conservativeness condition is sufficient: that the class of acceptable (...) abstraction principles be strictly logically symmetrically class conservative . The article concludes with an examination of which classes of abstraction principles meet this criteria. (shrink)

Neo-Fregean logicism attempts to base mathematics on abstraction principles. Since not all abstraction principles are acceptable, the neo-Fregeans need an account of which ones are. One of the most promising accounts is in terms of the notion of stability; roughly, that an abstraction principle is acceptable just in case it is satisfiable in all domains of sufficiently large cardinality. We present two counterexamples to stability as a sufficient condition for acceptability and argue that these counterexamples can be avoided only by (...) major departures from the existing neo-Fregean programme. (shrink)

Neo-Fregean logicism seeks to base mathematics on abstraction principles. But the acceptable abstraction principles are surrounded by unacceptable ones. This is the "bad company problem." In this introduction I first provide a brief historical overview of the problem. Then I outline the main responses that are currently being debated. In the course of doing so I provide summaries of the contributions to this special issue.

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...) propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. Elohim develops a novel, topic-sensitive truthmaker semantics for dynamic epistemic logic, and develops a novel, dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter \textbf{3} provides an abstraction principle for two-dimensional (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} is availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between Elohim's hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. Elohim countenances a hyperintensional semantics for novel epistemic abstractionist modalities. Elohim suggests, too, that higher observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for two-dimensional hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. Elohim invents a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Elohim provides a counter-example to epistemic closure for logical deduction. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

A central element in neo-Fregean philosophy of mathematics is the focus on abstraction principles, and the use of abstraction principles to ground various areas of mathematics. But as is well known, not all abstraction principles are in good standing. Various proposals for singling out the acceptable abstraction principles have been presented. Here I investigate what philosophical underpinnings can be provided for these proposals; specifically, underpinnings that fit the neo-Fregean's general outlook. Among the philosophical ideas I consider are: general views on (...) a priori justification; the idea of abstraction as reconceptualization, the idea that truth is prior to reference in the sense associated with Frege's context principle; and various broadly relativistic views. The conclusions are by and large negative. (shrink)

Forthcoming in Philosophical Compass. I explain why plural quantifiers and predicates have been thought to be philosophically significant.

Many recent writers in the philosophy of mathematics have put great weight on the relative categoricity of the traditional axiomatizations of our foundational theories of arithmetic and set theory. Another great enterprise in contemporary philosophy of mathematics has been Wright's and Hale's project of founding mathematics on abstraction principles. In earlier work, it was noted that one traditional abstraction principle, namely Hume's Principle, had a certain relative categoricity property, which here we term natural relative categoricity. In this paper, we show (...) that most other abstraction principles are not naturally relatively categorical, so that there is in fact a large amount of incompatibility between these two recent trends in contemporary philosophy of mathematics. To better understand the precise demands of relative categoricity in the context of abstraction principles, we compare and contrast these constraints to stability-like acceptability criteria on abstraction principles, the Tarski-Sher logicality requirements on abstraction principles studied by Antonelli and Fine, and supervaluational ideas coming out of Hodes' work. (shrink)

Fine and Antonelli introduce two generalizations of permutation invariance — internal invariance and simple/double invariance respectively. After sketching reasons why a solution to the Bad Company problem might require that abstraction principles be invariant in one or both senses, I identify the most fine-grained abstraction principle that is invariant in each sense. Hume’s Principle is the most fine-grained abstraction principle invariant in both senses. I conclude by suggesting that this partially explains the success of Hume’s Principle, and the comparative lack (...) of success in reconstructing areas of mathematics other than arithmetic based on non-invariant abstraction principles. (shrink)

Theoria, EarlyView. -/- In his recent book Thin Objects, Øystein Linnebo (2018) argues for the existence of a hierarchy of abstract objects, sufficient to model ZFC, via a novel and highly interesting argument that relies on a process called dynamic abstraction. This paper presents a way for a nominalist, someone opposed to the existence of abstract objects, to avoid Linnebo's conclusion by rejecting his claim that certain abstraction principles are sufficient for reference (RBA). Section 1 of the paper explains Linnebo's (...) argument for RBA. It offers a reading of Linnebo's work upon which he has two arguments for RBA: one deductive and one abductive, and argues that whilst the deductive argument is unsound the abductive one is prima facie plausible. The nominalist must therefore find a way to respond to the abductive argument. Section 2 outlines just such a response, by offering an alternative explanation of the cases Linnebo wishes to argue from. Most interestingly, it shows that abstraction in Linnebo's most difficult case (the “reference to ordinary bodies” case) can be achieved using mereological means, rather than relying on RBA. (shrink)

In this paper I examine the prospects for a successful neo–logicist reconstruction of the real numbers, focusing on Bob Hale's use of a cut-abstraction principle. There is a serious problem plaguing Hale's project. Natural generalizations of this principle imply that there are far more objects than one would expect from a position that stresses its epistemological conservativeness. In other words, the sort of abstraction needed to obtain a theory of the reals is rampantly inflationary. I also indicate briefly why this (...) problem is likely to reappear in any neo–logicist reconstruction of real analysis. (shrink)

In a recent article, I have explored the historical, mathematical, and philosophical issues related to the new theory of numerosities. The theory of numerosities provides a context in which to assign numerosities to infinite sets of natural numbers in such a way as to preserve the part-whole principle, namely if a set A is properly included in B then the numerosity of A is strictly less than the numerosity of B. Numerosities assignments differ from the standard assignment of size provided (...) by Cantor’s cardinality assignments. In this talk, I generalize some specific worries emerging from the theory of numerosities to a line of thought resulting in what I call a ‘good company’ objection to Hume’s Principle (HP). The talk has four main parts. The first takes a historical look at 19th-century attributions of equality of numbers in terms of one-one correlations and argues that there was no agreement as to how to extend such determinations to infinite sets of objects. This leads to the second part where I show that there are countably infinite many abstraction principles that are ‘good’, in the sense that they share the same virtues of HP and from which we can derive the axioms of second order arithmetic. The third part connects this material to a debate on Finite Hume Principle between Heck and MacBride and states the ‘good company’ objection. Finally, the last part gives a tentative taxonomy of possible neo-logicist responses to the ‘good company’ objection and makes a foray into the relevance of this material for the issue of cross-sortal identifications for abstractions. (shrink)

A thriving literature has developed over logical and mathematical pluralism – i.e. the views that several rival logical and mathematical theories can be equally correct. These have unfortunately grown separate; instead, they both could gain a great deal by a closer interaction. Our aim is thus to present some novel forms of abstractionist mathematical pluralism which can be modeled on parallel ways of substantiating logical pluralism (also in connection with logical anti-exceptionalism). To do this, we start by discussing the Good (...) Company Problem for neo-logicists recently raised by Paolo Mancosu (2016), concerning the existence of rival abstractive definitions of cardinal number which are nonetheless equally able to reconstruct Peano Arithmetic. We survey Mancosu’s envisaged possible replies to this predicament, and suggest as a further path the adoption of some form of mathematical pluralism concerning abstraction principles. We then explore three possible ways of substantiating such pluralism—Conceptual Pluralism,Domain Pluralism,Pluralism about Criteria—showing how each of them can be related to analogous proposals in the philosophy of logic. We conclude by considering advantages, concerns, and theoretical ramifications for these varieties of mathematical pluralism. (shrink)

In this article, I try to shed new light on Frege’s envisaged definitional introduction of real and complex numbers in _Die Grundlagen der Arithmetik_ (1884) and the status of cross-sortal identity claims with side glances at _Grundgesetze der Arithmetik_ (vol. I 1893, vol. II 1903). As far as I can see, this topic has not yet been discussed in the context of _Grundlagen_. I show why Frege’s strategy in the case of the projected definitions of real and complex numbers in (...) _Grundlagen_ is modelled on his definitional introduction of cardinal numbers in two steps, tentatively via a contextual definition and finally and definitively via an explicit definition. I argue that the strategy leaves a few important questions open, in particular one relating to the status of the envisioned abstraction principles for the real and complex numbers and another concerning the proper handling of cross-sortal identity claims. (shrink)

Wright claims that “the epistemology of good abstraction principles should be assimilated to that of basic principles of logical inference”. In this paper I follow Wright’s recommendation, but I consider a different epistemology of logic, namely anti-exceptionalism. Anti-exceptionalism’s main contention is that logic is not a priori, and that the choice between rival logics should be based on abductive criteria such as simplicity, adequacy to the data, strength, fruitfulness, and consistency. This paper’s goal is to lay down the foundations for (...) an application of the anti-exceptionalist methodology to abstraction principles. In Sect. 1 I outline my strategy. I show that anti-exceptionalism has a bearing on the so-called Bad Company problem (Sect. 2), and explore some versions of anti-exceptionalism about abstraction (Sect. 3). I then consider new criteria for choosing between rival abstraction principles, and, in particular, between consistent revisions of Frege’s Basic Law V (Sect. 4). I finally consider how the abstractionist can compare between competing criteria (Sect. 5), and argue that anti-exceptionalists should be pluralists about abstraction (Sect. 6). (shrink)

Paul Horwich (1990) once suggested restricting the T-Schema to the maximally consistent set of its instances. But Vann McGee (1992) proved that there are multiple incompatible such sets, none of which, given minimal assumptions, is recursively axiomatizable. The analogous view for set theory---that Naïve Comprehension should be restricted according to consistency maxims---has recently been defended by Laurence Goldstein (2006; 2013). It can be traced back to W.V.O. Quine(1951), who held that Naïve Comprehension embodies the only really intuitive conception of set (...) and should be restricted as little as possible. The view might even have been held by Ernst Zermelo (1908), who,according to Penelope Maddy (1988), subscribed to a ‘one step back from disaster’ rule of thumb: if a natural principle leads to contra-diction, the principle should be weakened just enough to block the contradiction. We prove a generalization of McGee’s Theorem, anduse it to show that the situation for set theory is the same as that for truth: there are multiple incompatible sets of instances of Naïve Comprehension, none of which, given minimal assumptions, is recursively axiomatizable. This shows that the view adumbrated by Goldstein, Quine and perhaps Zermelo is untenable. (shrink)

The injective version of Cantor’s theorem appears in full second-order logic as the inconsistency of the abstraction principle, Frege’s Basic Law V (BLV), an inconsistency easily shown using Russell’s paradox. This incompatibility is akin to others—most notably that of a (Dedekind) infinite universe with the Nuisance Principle (NP) discussed by neo-Fregean philosophers of mathematics. This paper uses the Burali–Forti paradox to demonstrate this incompatibility, and another closely related, without appeal to principles related to the axiom of choice—a result hitherto unestablished. (...) It discusses both the general interest of this result, its interest to neo-Fregean philosophy of mathematics, and the potential significance of the Burali–Fortian method of proof. (shrink)

Paul Benacerraf's argument from multiple reductions consists of a general argument against realism about the natural numbers (the view that numbers are objects), and a limited argument against reductionism about them (the view that numbers are identical with prima facie distinct entities). There is a widely recognized and severe difficulty with the former argument, but no comparably recognized such difficulty with the latter. Even so, reductionism in mathematics continues to thrive. In this paper I develop a difficulty for Benacerraf's argument (...) against reductionism that is of comparable severity to the now widely recognized difficulty with his general argument against realism. Thanks to Kit Fine, Hartry Field, Jeff Sebo, Ted Sider, Stephen Schiffer, and anonymous referees at Philosophia Mathematica for helpful comments on earlier versions of this paper. Thanks to Aron Edidin for many helpful discussions of the problems that inspired it. CiteULike Connotea Del.icio.us What's this? (shrink)

Objects appear to fall into different sorts, each with their own criteria for identity. This raises the question of whether sorts overlap. Abstractionists about numbers—those who think natural numbers are objects characterized by abstraction principles—face an acute version of this problem. Many abstraction principles appear to characterize the natural numbers. If each abstraction principle determines its own sort, then there is no single subject-matter of arithmetic—there are too many numbers. That is, unless objects can belong to more than one sort. (...) But if there are multi-sorted objects, there should be cross-sortal identity principles for identifying objects across sorts. The going cross-sortal identity principle, ECIA2 of Cook and Ebert (2005), solves the problem of too many numbers. But, I argue, it does so at a high cost. I therefore propose a novel cross-sortal identity principle, based on embeddings of the induced models of abstracts developed by Walsh (2012). The new criterion matches ECIA2’s success, but offers interestingly different answers to the more controversial identifications made by ECIA2. (shrink)

Philosophers love a priori knowledge: we delight in truths that can be known from the comfort of our armchairs, without the need to venture out in the world for confirmation. This is due not to laziness, but to two different considerations. First, it seems that many philosophical issues aren’t settled by our experience of the world — the nature of morality; the way concepts pick out objects; the structure of our experience of the world in which we find ourselves — (...) these issues seem to be decided not on the basis of our experience, but in some manner by things prior to (or independently of) that experience. Second, even when we are deeply interested in how our experience lends credence to our claims about the world, the matter remains of the remainder: we learn more about how experience contributes to knowledge when we see what knowledge is available independent of that experience. (shrink)

A number of formal constraints on acceptable abstraction principles have been proposed, including conservativeness and irenicity. Hume’s Principle, of course, satisfies these constraints. Here, variants of Hume’s Principle that allow us to count concepts instead of objects are examined. It is argued that, prima facie, these principles ought to be no more problematic than HP itself. But, as is shown here, these principles only enjoy the formal properties that have been suggested as indicative of acceptability if certain constraints on the (...) size of the continuum hold. As a result, whether or not these higher-order versions of Hume’s Principle are acceptable seems to be independent of standard (ZFC) set theory. This places the abstractionist in an uncomfortable dilemma: Either there is some inherent difference between counting objects and counting concepts, or new criteria for acceptability will need to be found. It is argued that neither horn looks promising. (shrink)

In this paper, I consider an argument for the claim that any satisfactory epistemology of mathematics will violate core tenets of naturalism, i.e. that mathematics cannot be naturalized. I find little reason for optimism that the argument can be effectively answered.

Richard Kimberly Heck and Paolo Mancosu have claimed that the possibility of non-Cantorian assignments of cardinalities to infinite concepts shows that Hume's Principle (HP) is not implicit in the concept of cardinal number. Neologicism would therefore be threatened by the ‘good company' HP is kept by such alternative assignments. In his review of Mancosu's book, Bob Hale argues, however, that ‘getting different numerosities for different countable infinite collections depends on taking the groups in a certain order – but it is (...) of the essence of cardinal numbers that the cardinal size of a collection does not depend upon how its members are ordered'. This paper's goal is to implement Hale's response to the Good Company problem by producing a Cantorian argument for HP. In Section 2, we present the Heck-Mancosu argument against neologicism. In Section 3, we discuss Hale's defence of Hume's Principle. In Section 4, we discuss Cantor's abstractionist definitions of number. In Section 5, we argue that good abstraction must comply with what we call ‘Gödel’s Minimal Account of Abstraction’ (GMAA). We finally show (Sections 5 and 6) that non-Cantorian theories of cardinality fail to satisfy GMAA. (shrink)

Abstraction principles provide implicit definitions of mathematical objects. In this paper, an abstraction principle defining categories is proposed. It is unsatisfiable and inconsistent in the expected ways. Two restricted versions of the principle which are consistent are presented.

C. S. Jenkins has recently proposed an account of arithmetical knowledge designed to be realist, empiricist, and apriorist: realist in that what’s the case in arithmetic doesn’t rely on us being any particular way; empiricist in that arithmetic knowledge crucially depends on the senses; and apriorist in that it accommodates the time-honored judgment that there is something special about arithmetical knowledge, something we have historically labeled with ‘a priori’. I’m here concerned with the prospects for extending Jenkins’s account beyond arithmetic—in (...) particular, to set theory. After setting out the central elements of Jenkins’s account and entertaining challenges to extending it to set theory, I conclude that a satisfactory such extension is unlikely. (shrink)

If${\cal C}$is a category whose objects are themselves categories, and${\cal C}$has a rich enough structure, it is known that we can recover the internal structure of thecategoriesin${\cal C}$entirely in terms of thearrowsin${\cal C}$. In this sense, the internal structure of the categories in a rich enough category of categories is visible in the structure of the category of categories itself.In this paper, we demonstrate that this result follows as a matter of logic – given one starts from the right definitions. (...) This is demonstrated by first producing an abstraction principle whose abstracts are functors, and then actually recovering the internal structure of the individual categories that intuitively stand at the sources and targets of these functors by examining the way these functors interact. The technique used in this construction will be useful elsewhere, and involves providing an abstract corresponding not to everyobjectof some given family, but to all the relevantmappingsof some family of objects.This construction should settle, in particular, questions about whether categories of categories qualify asautonomousmathematical objects – categories of categories are perfectly acceptable autonomous objects and thus, in particular, suitable for foundational purposes. (shrink)

One prominent criticism of the abstractionist program is the so-called Bad Company objection. The complaint is that abstraction principles cannot in general be a legitimate way to introduce mathematical theories, since some of them are inconsistent. The most notorious example, of course, is Frege’s Basic Law V. A common response to the objection suggests that an abstraction principle can be used to legitimately introduce a mathematical theory precisely when it is stable: when it can be made true on all sufficiently (...) large domains. In this paper, we raise a worry for this response to the Bad Company objection. We argue, perhaps surprisingly, that it requires very strong assumptions about the range of the second-order quantifiers; assumptions that the abstractionist should reject. (shrink)