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)

In a recent article, Barrett & Halvorson define a notion of equivalence for first-order theories, which they call “Morita equivalence.” To argue that Morita equivalence is a reasonable measure of “theoretical equivalence,” they make use of the claim that Morita extensions “say no more” than the theories they are extending. The goal of this article is to challenge this central claim by raising objections to their argument for it and by showing why there is good reason to think that the (...) claim itself is false. In light of these criticisms, this article develops a natural way for the advocate of Morita equivalence to respond. I prove that this response makes her criterion a special case of bi-interpretability, an already well-established barometer of theoretical equivalence. I conclude by providing reasons why the advocate of Morita equivalence should opt for a notion of theoretical equivalence that is defined in terms of interpretability rather than Morita extensions. (shrink)

In ‘The varieties of indispensability arguments’ Marco Panza and Andrea Sereni argue that, for any clear notion of indispensability, either there is no conclusive argument for the thesis that mathematics is indispensable to science, or the notion of indispensability at hand does not support mathematical realism. In this paper, I shall not object to this main thesis directly. I shall instead try to assess in a naturalistic spirit a family of objections the authors make along the way to the use (...) of indispensability premises in indispensability arguments. (shrink)

This paper presents a systematic study of the prehistory of the traditional subsystems of second-order arithmetic that feature prominently in the reverse mathematics program of Friedman and Simpson. We look in particular at: (i) the long arc from Poincar\'e to Feferman as concerns arithmetic definability and provability, (ii) the interplay between finitism and the formalization of analysis in the lecture notes and publications of Hilbert and Bernays, (iii) the uncertainty as to the constructive status of principles equivalent to Weak K\"onig's (...) Lemma, and (iv) the large-scale intellectual backdrop to arithmetical transfinite recursion in descriptive set theory and its effectivization by Borel, Lusin, Addison, and others. (shrink)

This article surveys recent literature by Parsons, McGee, Shapiro and others on the significance of categoricity arguments in the philosophy of mathematics. After discussing whether categoricity arguments are sufficient to secure reference to mathematical structures up to isomorphism, we assess what exactly is achieved by recent ‘internal’ renditions of the famous categoricity arguments for arithmetic and set theory.

Logic is about reasoning, or so the story goes. This thesis looks at the concept of logic, what it is, and what claims of correctness of logics amount to. The concept of logic is not a settled matter, and has not been throughout the history of it as a notion. Tools from conceptual analysis aid in this historical venture. Once the unsettledness of logic is established we see the repercussions in current debates in the philosophy of logic. Much of the (...) battle over the ‘one true logic’ is conceptually talking past each other. The theory of logics-as-formalizations is presented as a conceptually open theory of logic which is Carnapian in flavour and grounding. Rudolf Carnap’s notions surrounding ‘external’ and ‘pseudo-questions’ about linguistic frameworks apply to formalizations, thus logics, as well. An account of what formalizations are, a more structured sub-set of modelling, is given to ground the claim that logics are formalizations. Finally, a novel account of correctness, the COFE framework, is developed which allows the notions of logical monism, pluralism and nihilism to be more precisely formulated than they currently are in the discourse. (shrink)