This chapter explores the metaphysical views about higher-order logic held by two individuals responsible for introducing it to philosophy: Gottlob Frege (1848–1925) and Bertrand Russell (1872–1970). Frege understood a function at first as the remainder of the content of a proposition when one component was taken out or seen as replaceable by others, and later as a mapping between objects. His logic employed second-order quantifiers ranging over such functions, and he saw a deep division in nature between objects and functions. (...) Russell understood propositional functions as what is obtained when constituents of propositions are replaced by variables, but eventually denied that they were entities in their own right. Both encountered contradictions when supposing there to exist as many objects as functions, and both adopted views about the meaningfulness of higher-order discourse that were difficult to state from within their own strictures. (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)

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 rather unrestrained use of second-order logic in the neo-logicist program is critically examined. It is argued in some detail that it brings with it genuine set-theoretical existence assumptions and that the mathematical power that Hume’s Principle seems to provide, in the derivation of Frege’s Theorem, comes largely from the ‘logic’ assumed rather than from Hume’s Principle. It is shown that Hume’s Principle is in reality not stronger than the very weak Robinson Arithmetic Q. Consequently, only a few rudimentary facts (...) of arithmetic are logically derivable from Hume’s Principle. And that hardly counts as a vindication of logicism. (shrink)

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)

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)

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)

Quine often argued for a simple, untyped system of logic rather than the typed systems that were championed by Russell and Carnap, among others. He claimed that nothing important would be lost by eliminating sorts, and the result would be additional simplicity and elegance. In support of this claim, Quine conjectured that every many-sorted theory is equivalent to a single-sorted theory. We make this conjecture precise, and prove that it is true, at least according to one reasonable notion of theoretical (...) equivalence. Our clarification of Quine’s conjecture, however, exposes the shortcomings of his argument against many-sorted logic. (shrink)

Abstractionist programs in the philosophy of mathematics have focused on abstraction principles, taken as implicit definitions of the objects in the range of their operators. In second-order logic (SOL) with predicative comprehension, such principles are consistent but also (individually) mathematically weak. This paper, inspired by the work of Boolos (Proceedings of the Aristotelian Society 87, 137–151, 1986) and Zalta (Abstract Objects, vol. 160 of Synthese Library, 1983), examines explicit definitions of abstract objects. These axioms state that there is a unique (...) abstract encoding all concepts satisfying a given formula $$\phi (F)$$, with F a concept variable. Such a system is inconsistent in full SOL. It can be made consistent with several intricate tweaks, as Zalta has shown. Our approach in this article is simpler: we use a novel method to establish consistency in a restrictive version of predicative SOL. The resulting system, RPEAO, interprets first-order PA in extensional contexts, and has a natural extension delivering a peculiar interpretation of PA $$^2$$. (shrink)

We study the logical and computational properties of basic theorems of uncountable mathematics, including the Cousin and Lindelöf lemma published in 1895 and 1903. Historically, these lemmas were among the first formulations of open-cover compactness and the Lindelöf property, respectively. These notions are of great conceptual importance: the former is commonly viewed as a way of treating uncountable sets like e.g. [Formula: see text] as “almost finite”, while the latter allows one to treat uncountable sets like e.g. [Formula: see text] (...) as “almost countable”. This reduction of the uncountable to the finite/countable turns out to have a considerable logical and computational cost: we show that the aforementioned lemmas, and many related theorems, are extremely hard to prove, while the associated sub-covers are extremely hard to compute. Indeed, in terms of the standard scale (based on comprehension axioms), a proof of these lemmas requires at least the full extent of second-order arithmetic, a system originating from Hilbert–Bernays’ Grundlagen der Mathematik. This observation has far-reaching implications for the Grundlagen’s spiritual successor, the program of Reverse Mathematics, and the associated Gödel hierarchy. We also show that the Cousin lemma is essential for the development of the gauge integral, a generalization of the Lebesgue and improper Riemann integrals that also uniquely provides a direct formalization of Feynman’s path integral. (shrink)

Frege's Grundgesetze was one of the 19th century forerunners to contemporary set theory which was plagued by the Russell paradox. In recent years, it has been shown that subsystems of the Grundgesetze formed by restricting the comprehension schema are consistent. One aim of this paper is to ascertain how much set theory can be developed within these consistent fragments of the Grundgesetze, and our main theorem shows that there is a model of a fragment of the Grundgesetze which defines a (...) model of all the axioms of Zermelo-Fraenkel set theory with the exception of the power set axiom. The proof of this result appeals to G\"odel's constructible universe of sets, which G\"odel famously used to show the relative consistency of the continuum hypothesis. More specifically, our proofs appeal to Kripke and Platek's idea of the projectum within the constructible universe as well as to a weak version of uniformization (which does not involve knowledge of Jensen's fine structure theory). The axioms of the Grundgesetze are examples of abstraction principles, and the other primary aim of this paper is to articulate a sufficient condition for the consistency of abstraction principles with limited amounts of comprehension. As an application, we resolve an analogue of the joint consistency problem in the predicative setting. (shrink)

A crucial part of the contemporary interest in logicism in the philosophy of mathematics resides in its idea that arithmetical knowledge may be based on logical knowledge. Here an implementation of this idea is considered that holds that knowledge of arithmetical principles may be based on two things: (i) knowledge of logical principles and (ii) knowledge that the arithmetical principles are representable in the logical principles. The notions of representation considered here are related to theory-based and structure-based notions of representation (...) from contemporary mathematical logic. It is argued that the theory-based versions of such logicism are either too liberal (the plethora problem) or are committed to intuitively incorrect closure conditions (the consistency problem). Structure-based versions must on the other hand respond to a charge of begging the question (the circularity problem) or explain how one may have a knowledge of structure in advance of a knowledge of axioms (the signature problem). This discussion is significant because it gives us a better idea of what a notion of representation must look like if it is to aid in realizing some of the traditional epistemic aims of logicism in the philosophy of mathematics. (shrink)

This paper attempts to address the question what logical strength theories of truth have by considering such questions as: If you take a theory T and add a theory of truth to it, how strong is the resulting theory, as compared to T? Once the question has been properly formulated, the answer turns out to be about as elegant as one could want: Adding a theory of truth to a finitely axiomatized theory T is more or less equivalent to a (...) kind of abstract consistency statement. A large part of the interest of the paper lies in the way syntactic theories are 'disentangled' from object theories. (shrink)

Thought: A Journal of Philosophy, EarlyView.

This paper presents a new approach to the class-theoretic paradoxes. In the first part of the paper, I will distinguish classes from sets, describe the function of class talk, and present several reasons for postulating type-free classes. This involves applications to the problem of unrestricted quantification, reduction of properties, natural language semantics, and the epistemology of mathematics. In the second part of the paper, I will present some axioms for type-free classes. My approach is loosely based on the Gödel–Russell idea (...) of limited ranges of significance. It is shown how to derive the second-order Dedekind–Peano axioms within that theory. I conclude by discussing whether the theory can be used as a solution to the problem of unrestricted quantification. In an appendix, I prove the consistency of the class theory relative to Zermelo–Fraenkel set theory. (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 paper expands upon a way in which we might rationally doubt that there are multiple sizes of infinity. The argument draws its inspiration from recent work in the philosophy of truth and philosophy of set theory. More specifically, elements of contextualist theories of truth and multiverse accounts of set theory are brought together in an effort to make sense of Cantor’s troubling theorem. The resultant theory provides an alternative philosophical perspective on the transfinite, but has limited impact on everyday (...) mathematical practice. (shrink)

This paper presents new constructions of models of Hume's Principle and Basic Law V with restricted amounts of comprehension. The techniques used in these constructions are drawn from hyperarithmetic theory and the model theory of fields, and formalizing these techniques within various subsystems of second-order Peano arithmetic allows one to put upper and lower bounds on the interpretability strength of these theories and hence to compare these theories to the canonical subsystems of second-order arithmetic. The main results of this paper (...) are: (i) there is a consistent extension of the hyperarithmetic fragment of Basic Law V which interprets the hyperarithmetic fragment of second-order Peano arithmetic, and (ii) the hyperarithmetic fragment of Hume's Principle does not interpret the hyperarithmetic fragment of second-order Peano arithmetic, so that in this specific sense there is no predicative version of Frege's Theorem. (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)

In this paper, we characterize the strength of the predicative Frege hierarchy, , introduced by John Burgess in his book [J. Burgess, Fixing frege, in: Princeton Monographs in Philosophy, Princeton University Press, Princeton, 2005]. We show that and are mutually interpretable. It follows that is mutually interpretable with Q. This fact was proved earlier by Mihai Ganea in [M. Ganea, Burgess’ PV is Robinson’s Q, The Journal of Symbolic Logic 72 619–624] using a different proof. Another consequence of the our (...) main result is that is mutually interpretable with Kalmar Arithmetic . The fact that interprets EA was proved earlier by Burgess. We provide a different proof. Each of the theories is finitely axiomatizable. Our main result implies that the whole hierarchy taken together, , is not finitely axiomatizable. What is more: no theory that is mutually locally interpretable with is finitely axiomatizable. (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)

This entry introduces the reader to the main ideas in Frege's philosophy of logic, mathematics, and language.

Is a logicist bound to the claim that as a matter of analytic truth there is an actual infinity of objects? If Hume’s Principle is analytic then in the standard setting the answer appears to be yes. Hodes’s work pointed to a way out by offering a modal picture in which only a potential infinity was posited. However, this project was abandoned due to apparent failures of cross-world predication. We re-explore this idea and discover that in the setting of the (...) potential infinite one can interpret first-order Peano arithmetic, but not second-order Peano arithmetic. We conclude that in order for the logicist to weaken the metaphysically loaded claim of necessary actual infinities, they must also weaken the mathematics they recover. (shrink)

In this paper, we investigate the phenomenon ofspeed-upin the context of theories of truth. We focus on axiomatic theories of truth extending Peano arithmetic. We are particularly interested on whether conservative extensions of PA have speed-up and on how this relates to a deflationist account. We show that disquotational theories have no significant speed-up, in contrast to some compositional theories, and we briefly assess the philosophical implications of these results.

We shall use Gödel’s Second Incompleteness Theorem to show that consistency is not possibility, and then argue that the argument does serious damage to some theories of modality where consistency plays a major but not exclusive role.

PG (Plural Grundgesetze) is a consistent second-order system which is aimed to derive second-order Peano arithmetic. It employs the notion of plural quantification and a few Fregean devices, among which the infamous Basic Law V. George Boolos’ plural semantics is replaced with Enrico Martino’s Acts of Choice Semantics (ACS), which is developed from the notion of arbitrary reference in mathematical reasoning. Also, substitutional quantification is exploited to interpret quantification into predicate position. ACS provides a form of logicism which is radically (...) alternative to Frege’s and which is grounded on the existence of individuals rather than on the existence of concepts. (shrink)

Øystein Linnebo has recently shown that the existence of successors cannot be proven in predicative Frege arithmetic, using Frege’s definitions of arithmetical notions. By contrast, it is shown here that the existence of successor can be proven in ramified predicative Frege arithmetic.

This paper investigates a set of issues connected with the so-called conservativeness argument against deflationism. Although I do not defend that argument, I think the discussion of it has raised some interesting questions about whether what I call “compositional principles,” such as “a conjunction is true iff its conjuncts are true,” have substantial content or are in some sense logically trivial. The paper presents a series of results that purport to show that the compositional principles for a first-order language, taken (...) together, have substantial logical strength, amounting to a kind of abstract consistency statement. (shrink)

One of the more distinctive features of Bob Hale and Crispin Wright’s neologicism about arithmetic is their invocation of Frege’s Constraint – roughly, the requirement that the core empirical applications for a class of numbers be “built directly into” their formal characterization. In particular, they maintain that, if adopted, Frege’s Constraint adjudicates in favor of their preferred foundation – Hume’s Principle – and against alternatives, such as the Dedekind-Peano axioms. In what follows we establish two main claims. First, we show (...) that, if sound, Hale and Wright’s arguments for Frege’s Constraint at most establish a version on which the relevant application of the naturals is transitive counting – roughly, the counting procedure by which numerals are used to answer “how many”-questions. Second, we show that this version of Frege’s Constraint fails to adjudicate in favor of Hume’s Principle. If this is the version of Frege’s Constraint that a foundation for arithmetic must respect, then Hume’s Principle no more – and no less – meets the requirement than the Dedekind-Peano axioms do. (shrink)

We show that, by choosing definitions carefully, a version of Frege's theorem can be proved in intuitionistic logic.

In this paper we show how to interpret Robinson’s arithmetic Q and the theory R of Tarski, Mostowski, and Robinson as theories of cardinals in very weak theories of relations over a domain.

This article treats three aspects of Frege's discussions of definitions. First, I survey Frege's main criticisms of definitions in mathematics. Second, I consider Frege's apparent change of mind on the legitimacy of contextual definitions and its significance for recent neo-Fregean logicism. In the remainder of the article I discuss a critical question about the definitions on which Frege's proofs of the laws of arithmetic depend: do the logical structures of the definientia reflect the understanding of arithmetical terms prevailing prior to (...) Frege's analyses? Unless they do, it is unclear how Frege's proofs demonstrate the analyticity of the arithmetic in use before logicism. Yet, especially in late writings, Frege characterizes definitions as arbitrary stipulations of the senses or references of expressions unrelated to pre-definitional understanding. I conclude by examining some options for conceiving of the status of Frege's logicism in light of this apparent tension, and outline a suggestion for a philosophically fruitful way of resolving this tension. (shrink)

PG (Plural Grundgesetze) is a predicative monadic second-order system which is aimed to derive second-order Peano arithmetic. It exploits the notion of plural quantification and a few Fregean devices, among which the infamous Basic Law V. In this paper, a model-theoretical consistency proof for the system PG is provided.

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)

In this note we derive Robinson???s Arithmetic from Hume???s Principle in the context of very weak theories of classes and relations.

PG (Plural Grundgesetze) is a predicative monadic second-order system which exploits the notion of plural quantification and a few Fregean devices, among which a formulation of the infamous Basic Law V. It is shown that second-order Peano arithmetic can be derived in PG. I also investigate the philosophical issue of predicativism connected to PG. In particular, as predicativism about concepts seems rather un-Fregean, I analyse whether there is a way to make predicativism compatible with Frege’s logicism.

In the Grundlagen , Frege offers eight main arguments, together with a series of more minor supporting arguments, against Mill’s view that numbers are “properties of external things”. This paper reviews all eight of these arguments, arguing that none are conclusive.

An elementary theory of concatenation,QT+, is introduced and used to establish mutual interpretability of Robinson arithmetic, Minimal Predicative Set Theory, quantifier-free part of Kirby’s finitary set theory, and Adjunctive Set Theory, with or without extensionality. The most basic arithmetic and simplest set theory thus turn out to be variants of string theory.

We present a logically detailed case-study of Darwinian evolutionary explanation. Special features of Darwin’s explanatory schema made it an unusual theoretical breakthrough, from the point of view of the philosophy of science. The schema employs no theoretical terms, and puts forward no theoretical hypotheses. Instead, it uses three observational generalizations—Variability, Heritability and Differential Reproduction—along with an innocuous assumption of Causal Efficacy, to derive Adaptive Evolution as a necessary consequence. Adaptive Evolution in turn, with one assumption of scale (‘Deep Time’), implies (...) the observational generalization of Adaptation. It is a fascinating methodological task to regiment the premises and make the reasoning both rigorous and clear. Doing so reveals how surprisingly small an amount of mathematics is needed in order to carry out the argument. The investigation also reveals the crucial role played by heritability, and how heritability itself admits of Darwinian explanation. (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.

Category theory is often treated as an algebraic foundation for mathematics, and the widely known algebraization of ZF set theory in terms of this discipline is referenced as “categorical set theory” or “set theory for category theory”. The method of algebraization used in this theory has not been formulated in terms of universal algebra so far. In current paper, a _universal algebraic_ method, i.e. one formulated in terms of universal algebra, is presented and used for algebraization of a ground mereological (...) system described as “quantitative” (QMS) and of the standard set theories built upon it. The QMS is algebraized by using abelian generalized groups (AGGs) generalizing both abelian groups and Boolean algebras. To algebraize set theory, the AGG are enriched with operators to produce _extensional algebras_ (EA) of Tarskian “Boolean algebras with operators” type. EAs explicate the intuition of set theory’ universes (of discourse). The axiomatic set theory presented in this paper, named _extension theory_, previously went through an intuitive phase of development during its use by the author in computer science projects, where it served as the basis for development of a foundational data science framework and an extensional model of natural languages also outlined here. (shrink)

Frege's theorem says that second-order Peano arithmetic is interpretable in Hume's Principle and full impredicative comprehension. Hume's Principle is one example of an abstraction principle, while another paradigmatic example is Basic Law V from Frege's Grundgesetze. In this paper we study the strength of abstraction principles in the presence of predicative restrictions on the comprehension schema, and in particular we study a predicative Fregean theory which contains all the abstraction principles whose underlying equivalence relations can be proven to be equivalence (...) relations in a weak background second-order logic. We show that this predicative Fregean theory interprets second-order Peano arithmetic. (shrink)

ABSTRACT Four philosophical concerns about higher-order logic in general and the specific demands placed on it by the neo-logicist project are distinguished. The paper critically reviews recent responses to these concerns by, respectively, the late Bob Hale, Richard Kimberly Heck, and myself. It is argued that these score some successes. The main aim of the paper, however, is to argue that the most serious objection to the applications of higher-order logic required by the neo-logicist project has not been properly understood. (...) The paper concludes by outlining a strategy, prefigured in recent work of Øystein Linnebo, for meeting this objection. (shrink)

This paper investigates, formulates and proves an indexical barrier theorem, according to which sets of non-indexical sentences do not entail (except under specified special circumstances) indexical sentences. It surveys the usual difficulties for this kind of project, as well some that are specific to the case of indexicals, and adapts the strategy of Restall and Russell's "Barriers to Implication" to overcome these. At the end of the paper a reverse barrier theorem is also proved, according to which an indexical sentence (...) will not, except under specified circumstances, entail a non-indexical one. (shrink)