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)

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)

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 paper sets out a predicative response to the Russell-Myhill paradox of propositions within the framework of Church’s intensional logic. A predicative response places restrictions on the full comprehension schema, which asserts that every formula determines a higher-order entity. In addition to motivating the restriction on the comprehension schema from intuitions about the stability of reference, this paper contains a consistency proof for the predicative response to the Russell-Myhill paradox. The models used to establish this consistency also model other axioms (...) of Church’s intensional logic that have been criticized by Parsons and Klement: this, it turns out, is due to resources which also permit an interpretation of a fragment of Gallin’s intensional logic. Finally, the relation between the predicative response to the Russell-Myhill paradox of propositions and the Russell paradox of sets is discussed, and it is shown that the predicative conception of set induced by this predicative intensional logic allows one to respond to the Wehmeier problem of many non-extensions. (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)

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

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)

Bob Hale has defended a new conception of properties that is broadly Fregean in two key respects. First, like Frege, Hale insists that every property can be defined by an open formula. Second, like Frege, but unlike later definabilists, Hale seeks to justify full impredicative property comprehension. The most innovative part of his defense, we think, is a “definability constraint” that can serve as an implicit definition of the domain of properties. We make this constraint formally precise and prove that (...) it fails to characterize the domain uniquely. Thus, we conclude, there is no easy road to impredicative definabilism. (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)

This article improves two existing theorems of interest to neologicist philosophers of mathematics. The first is a classification theorem due to Fine for equivalence relations between concepts definable in a well-behaved second-order logic. The improved theorem states that if an equivalence relation E is defined without nonlogical vocabulary, then the bicardinal slice of any equivalence class—those equinumerous elements of the equivalence class with equinumerous complements—can have one of only three profiles. The improvements to Fine’s theorem allow for an analysis of (...) the well-behaved models had by an abstraction principle, and this in turn leads to an improvement of Walsh and Ebels-Duggan’s relative categoricity theorem. (shrink)