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)

Reductionist realist accounts of certain entities, such as the natural numbers and propositions, have been taken to be fatally undermined by what we may call the problem of arbitrary identification. The problem is that there are multiple and equally adequate reductions of the natural numbers to sets (see Benacerraf, 1965), as well as of propositions to unstructured or structured entities (see, e.g., Bealer, 1998; King, Soames, & Speaks, 2014; Melia, 1992). This paper sets out to solve the problem by canvassing (...) what we may call the arbitrary reference strategy. The main claims of such strategy are 2. First, we do not know which objects are the referents of proposition and numerical terms since their reference is fixed arbitrarily. Second, our ignorance of which object is picked out as the referent does not entail that no object is referred to by the relevant expression. Different articulations of the strategy are assessed, and a new one is defended. (shrink)

Several natural languages such as English contain prima facie different kinds of referential and quantificational expressions. In particular, natural languages.

Plural Logic is an extension of First-Order Logic which has, as well as singular terms and quantifiers, their plural counterparts. Analogously, Higher-Level Plural Logic is an extension of Plural Logic which has, as well as plural terms and quantifiers, higher-level plural ones. Roughly speaking, higher-level plurals stand to plurals like plurals stand to singulars; they are pluralised plurals. Allegedly, Higher-Level Plural Logic enjoys the expressive power of a simple type theory while committing us to nothing more than the austere ontology (...) of First-Order Logic. Were this true, Higher-Level Plural Logic would be a useful tool, with various applications in philosophy and linguistics. However, while the notions of plural reference and quantification enjoy widespread acceptance today, their higher-level counterparts have been received with a lot of scepticism. In this paper, I argue for the legitimacy of Higher-Level Plural Logic by providing evidence to the effect that natural languages contain higher-level plural expressions and showing that it is likely that they do so in an indispensable manner. Since the arguments I put forward are of the same sort advocates of Plural Logic have employed to defend their position, I conclude that the commonly held view that Plural Logic is legitimate, but not so its higher-level plural extensions is untenable. (shrink)

PLV (Plural Basic Law V) is a consistent second-order system which is aimed to derive second-order Peano arithmetic. It employs the notion of plural quantification and a first-order formulation of Frege's 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. 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)

Ordinary English contains different forms of quantification over objects. In addition to the usual singular quantification, as in 'There is an apple on the table', there is plural quantification, as in 'There are some apples on the table'. Ever since Frege, formal logic has favored the two singular quantifiers ∀x and ∃x over their plural counterparts ∀xx and ∃xx (to be read as for any things xx and there are some things xx). But in recent decades it has been argued (...) that we have good reason to admit among our primitive logical notions also the plural quantifiers ∀xx and ∃xx. More controversially, it has been argued that the resulting formal system with plural as well as singular quantification qualifies as ‘pure logic’; in particular, that it is universally applicable, ontologically innocent, and perfectly well understood. In addition to being interesting in its own right, this thesis will, if correct, make plural quantification available as an innocent but extremely powerful tool in metaphysics, philosophy of mathematics, and philosophical logic. For instance, George Boolos has used plural quantification to interpret monadic second-order logic and has argued on this basis that monadic second-order logic qualifies as “pure logic.” Plural quantification has also been used in attempts to defend logicist ideas, to account for set theory, and to eliminate ontological commitments to mathematical objects and complex objects. (shrink)

Plural Logic is an extension of First-Order Logic with plural terms and quantifiers. When its plural terms are interpreted as denoting more than one object at once, Plural Logic is usually taken to be ontologically innocent: plural quantifiers do not require a domain of their own, but range plurally over the first-order domain of quantification. Given that Plural Logic is equi-interpretable with Monadic Second-Order Logic, it gives us its expressive power at the low ontological cost of a first-order language. This (...) makes it a valuable tool in various areas of philosophy. Some authors believe that Plural Logic can be extended into an even more expressive logic, Higher-Level Plural Logic, by adding higher-level plural terms and quantifiers to it. The basic idea is that second-level plurals stand to plurals like plurals stand to singulars. Allegedly, Higher-Level Plural Logic enjoys the expressive power of type theory while, again, committing us only to the austere ontology of a first-order language. Were this really the case, Higher-Level Plural Logic would be a very useful tool, extending and strengthening some of the applications of Plural Logic. However, while the notions of plural reference and quantification enjoy widespread acceptance today, their higher-level counterparts have been received with scepticism. The main objection raised against them is that higher-level plural reference is unintelligible. This has been argued, among others, on the grounds that there are no higher-level plurals in natural language and that, if there were any, they could be eliminated. In this thesis, after introducing the debate on plurals in Chapters 1 and 2, I turn to defending the legitimacy of the notion of higher-level plural reference. To this end, in Chapter 3, I present and elucidate the notion. Next, in Chapter 4, I show that some natural languages clearly contain these expressions and that they do so in an ineliminable manner. Finally, in Chapters 5 and 6, I develop a semantics for higher-level plurals that employs only devices previously well-understood by English speakers. To finish, in Chapter 7, I describe an application of Higher-level Plural Logic: a strengthening of the neo-Fregean programme. After describing my proposal, I turn to the issue of the logical status of this formalism and defend an optimistic take on the matter. (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)