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)

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)

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.

While second-order quantifiers have long been known to admit nonstandard, or interpretations, first-order quantifiers (when properly viewed as predicates of predicates) also allow a kind of interpretation that does not presuppose the full power-set of that interpretationgeneral” interpretations for (unary) first-order quantifiers in a general setting, emphasizing the effects of imposing various further constraints that the interpretation is to satisfy.

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)

Neo-Fregeans have been troubled by the Nuisance Principle, an abstraction principle that is consistent but not jointly satisfiable with the favored abstraction principle HP. We show that logically this situation persists if one looks at joint consistency rather than satisfiability: under a modest assumption about infinite concepts, NP is also inconsistent with HP.

This paper presents a formalization of first-order arithmetic characterizing the natural numbers as abstracta of the equinumerosity relation. The formalization turns on the interaction of a nonstandard cardinality quantifier with an abstraction operator assigning objects to predicates. The project draws its philosophical motivation from a nonreductionist conception of logicism, a deflationary view of abstraction, and an approach to formal arithmetic that emphasizes the cardinal properties of the natural numbers over the structural ones.

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)

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)

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)

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)

The paper outlines a novel version of mathematical structuralism related to invariants. The main objective here is twofold: first, to present a formal theory of structures based on the structuralist methodology underlying work with invariants. Second, to show that the resulting framework allows one to model several typical operations in modern mathematical practice: the comparison of invariants in terms of their distinctive power, the bundling of incomparable invariants to increase their collective strength, as well as a heuristic principle related to (...) the search for new invariants. (shrink)

The purpose of this note is to present a simplification of the system of arithmetical axioms given in previous work; specifically, it is shown how the induction principle can in fact be obtained from the remaining axioms, without the need of explicit postulation. The argument might be of more general interest, beyond the specifics of the proposed axiomatization, as it highlights the interaction of the notion of Dedekind-finiteness and the induction principle.

In this paper we compare the propositional logic of Frege’s Grundgesetze der Arithmetik to modern propositional systems, and show that Frege does not have a separable propositional logic, definable in terms of primitives of Grundgesetze, that corresponds to modern formulations of the logic of “not”, “and”, “or”, and “if…then…”. Along the way we prove a number of novel results about the system of propositional logic found in Grundgesetze, and the broader system obtained by including identity. In particular, we show that (...) the propositional connectives that are definable in terms of Frege’s horizontal, negation, and conditional are exactly the connectives that fuse with the horizontal, and we show that the logical operators that are definable in terms of the horizontal, negation, the conditional, and identity are exactly the operators that are invariant with respect to permutations on the domain that leave the truth-values fixed. We conclude with some general observations regarding how Frege understood his logic, and how this understanding differs from modern views. (shrink)

One of the key features of modern mathematics is the adoption of the abstract method. Our goal in this paper is to propose an explication of that method that is rooted in the history of the subject.

In this talk I present the main results from Anta (2021), namely, that the theoretical division between Boltzmannian and Gibbsian statistical mechanics should be understood as a separation in the epistemic capabilities of this physical discipline. In particular, while from the Boltzmannian framework one can generate powerful explanations of thermal processes by appealing to their microdynamics, from the Gibbsian framework one can predict observable values in a computationally effective way. Finally, I argue that this statistical mechanical schism contradicts the Hempelian (...) (1958) thesis that the predictive power of a scientific theory is directly proportional to its explanatory potential, and vice versa. (shrink)

Fitch's basic logic is an untyped illative combinatory logic with unrestricted principles of abstraction effecting a type collapse between properties (or concepts) and individual elements of an abstract syntax. Fitch does not work axiomatically and the abstraction operation is not a primitive feature of the inductive clauses defining the logic. Fitch's proof that basic logic has unlimited abstraction is not clear and his proof contains a number of errors that have so far gone undetected. This paper corrects these errors and (...) presents a reasonably intuitive proof that Fitch's system K supports an implicit abstraction operation. Some general remarks on the philosophical significance of basic logic, especially with respect to neo-logicism, are offered, and the paper concludes that basic logic models a highly intensional form of logicism. (shrink)

Gottlob Frege defined cardinal numbers in terms of value-ranges governed by the inconsistent Basic Law V. Neo-logicists have revived something like Frege's original project by introducing cardinal numbers as primitive objects, governed by Hume's Principle. A neo-logicist foundation for set theory, however, requires a consistent theory of value-ranges of some sort. Thus, it is natural to ask whether we can reconstruct the cardinal numbers by retaining Frege's definition and adopting an alternative consistent principle governing value-ranges. Given some natural assumptions regarding (...) what an acceptable neo-logicistic theory of value-ranges might look like, successfully implementing this alternative approach is impossible. (shrink)

This volume covers a wide range of topics in the most recent debates in the philosophy of mathematics, and is dedicated to how semantic, epistemological, ontological and logical issues interact in the attempt to give a satisfactory picture of mathematical knowledge. The essays collected here explore the semantic and epistemic problems raised by different kinds of mathematical objects, by their characterization in terms of axiomatic theories, and by the objectivity of both pure and applied mathematics. They investigate controversial aspects of (...) contemporary theories such as neo-logicist abstractionism, structuralism, or multiversism about sets, by discussing different conceptions of mathematical realism and rival relativistic views on the mathematical universe. They consider fundamental philosophical notions such as set, cardinal number, truth, ground, finiteness and infinity, examining how their informal conceptions can best be captured in formal theories. The philosophy of mathematics is an extremely lively field of inquiry, with extensive reaches in disciplines such as logic and philosophy of logic, semantics, ontology, epistemology, cognitive sciences, as well as history and philosophy of mathematics and science. By bringing together well-known scholars and younger researchers, the essays in this collection – prompted by the meetings of the Italian Network for the Philosophy of Mathematics (FilMat) – show how much valuable research is currently being pursued in this area, and how many roads ahead are still open for promising solutions to long-standing philosophical concerns. Promoted by the Italian Network for the Philosophy of Mathematics – FilMat. (shrink)