This essay clarifies quantifier variance and uses it to provide a theory of indefinite extensibility that I call the variance theory of indefinite extensibility. The indefinite extensibility response to the set-theoretic paradoxes sees each argument for paradox as a demonstration that we have come to a different and more expansive understanding of ‘all sets’. But indefinite extensibility is philosophically puzzling: extant accounts are either metasemantically suspect in requiring mysterious mechanisms of domain expansion, or metaphysically suspect in requiring nonstandard assumptions about (...) mathematical objects. Happily, the view of quantifier meanings that underwrites quantifier variance can be used to provide an account of indefinite extensibility that is both metasemantically and metaphysically satisfying. Section 1 introduces the puzzle of indefinite extensibility; section 2 develops and clarifies the metasemantics of quantifier variance; section 3 solves section 1's puzzle of indefinite extensibility by applying section 2's account of quantifier meanings; and section 4 compares the theory developed in section 3 to several other theories in the literature. (shrink)

The paper gives an impression of the multi-dimensionality of mathematics as a human activity. This 'phenomenological' exercise is performed within an analytic framework that is both an expansion and a refinement of the one proposed by Kitcher. Such a particular tool enables one to retain an integrated picture while nevertheless welcoming an ample diversity of perspectives on mathematical practices, that is, from different disciplines, with different scopes, and at different levels. Its functioning is clarified by fitting in illustrations based on (...) actual research. (shrink)

Richard Kimberly Heck and Paolo Mancosu have claimed that the possibility of non-Cantorian assignments of cardinalities to infinite concepts shows that Hume's Principle (HP) is not implicit in the concept of cardinal number. Neologicism would therefore be threatened by the ‘good company' HP is kept by such alternative assignments. In his review of Mancosu's book, Bob Hale argues, however, that ‘getting different numerosities for different countable infinite collections depends on taking the groups in a certain order – but it is (...) of the essence of cardinal numbers that the cardinal size of a collection does not depend upon how its members are ordered'. This paper's goal is to implement Hale's response to the Good Company problem by producing a Cantorian argument for HP. In Section 2, we present the Heck-Mancosu argument against neologicism. In Section 3, we discuss Hale's defence of Hume's Principle. In Section 4, we discuss Cantor's abstractionist definitions of number. In Section 5, we argue that good abstraction must comply with what we call ‘Gödel’s Minimal Account of Abstraction’ (GMAA). We finally show (Sections 5 and 6) that non-Cantorian theories of cardinality fail to satisfy GMAA. (shrink)

Set theory deals with the most fundamental existence questions in mathematics—questions which affect other areas of mathematics, from the real numbers to structures of all kinds, but which are posed as dealing with the existence of sets. Especially noteworthy are principles establishing the existence of some infinite sets, the so-called “arbitrary sets.” This paper is devoted to an analysis of the motivating goal of studying arbitrary sets, usually referred to under the labels of quasi-combinatorialism or combinatorial maximality. After explaining what (...) is meant by definability and by “arbitrariness,” a first historical part discusses the strong motives why set theory was conceived as a theory of arbitrary sets, emphasizing connections with analysis and particularly with the continuum of real numbers. Judged from this perspective, the axiom of choice stands out as a most central and natural set-theoretic principle (in the sense of quasi-combinatorialism). A second part starts by considering the potential mismatch between the formal systems of mathematics and their motivating conceptions, and proceeds to offer an elementary discussion of how far the Zermelo—Fraenkel system goes in laying out principles that capture the idea of “arbitrary sets”. We argue that the theory is rather poor in this respect. (shrink)

Remarks on the Foundations of Mathematics, Wittgenstein, despite his official 'mathematical nonrevisionism', slips into attempting to refute Gödel's theorem. Actually, Wittgenstein could have used Gödel's theorem to good effect, to support his view that proof, and even truth, are 'family resemblance' concepts. The reason that Wittgenstein did not see all this is that Gödel's theorem had become an icon of mathematical realism, and he was blinded by his own ideology. The essay is a reply to Juliet Floyd's work on Gödel: (...) what she says Wittgenstein said, I say he should have said, but didn't (couldn't). (shrink)

The existence of non-standard models of first-order Peano-Arithmetic (PA) threatens to undermine the claim of the moderate mathematical realist that non-mysterious access to the natural number structure is possible on the basis of our best arithmetical theories. The move to logics stronger than FOL is denied to the moderate realist on the grounds that it merely shifts the indeterminacy “one level up” into the meta-theory by, illegitimately, assuming the determinacy of the notions needed to formulate such logics. This paper argues (...) that the challenge can be met. We show how the quantifier “there are infinitely many” can be uniquely determined in a naturalistically acceptable fashion and thus be used in the formulation of a theory of arithmetic. We compare the approach pursued here with Field’s justification of the same device and the popular strategy of invoking a second-order formalism, and argue that it is more robust than either of the alternative proposals. (shrink)

The purpose of this article is to delimit what can and cannot be claimed on behalf of second-order logic. The starting point is some of the discussions surrounding my Foundations without Foundationalism: A Case for Secondorder Logic.

Influenced by G. E. Moore, Russell broke with Idealism towards the end of 1898; but in later years he characterized his meeting Peano in August 1900 as ?the most important event? in ?the most important year in my intellectual life?. While Russell discovered his paradox during his post-Peano period, the question arises whether he was already committed, during his pre-Peano Moorean period, to assumptions from which his paradox may be derived. Peter Hylton has argued that the pre-Peano Russell was thus (...) vulnerable to (at least one version of) Russell's paradox and hence that the paradox exposes a pre-existing difficulty in Russell's Moorean philosophy. Contrary to Hylton, I argue that the Moorean Russell adhered to views which insulated him against the paradox. Further, I argue that Russell became vulnerable to his paradox as a result of changes in his Moorean position occasioned, first, by his acceptance of Cantor's theory of the transfinite, and, second, by his correspondence with Frege. I conclude with some general comments regarding Russell's acceptance of naïve set theory. (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.

This paper argues that, insofar as we doubt the bivalence of the Continuum Hypothesis or the truth of the Axiom of Choice, we should also doubt the consistency of third-order arithmetic, both the classical and intuitionistic versions. -/- Underlying this argument is the following philosophical view. Mathematical belief springs from certain intuitions, each of which can be either accepted or doubted in its entirety, but not half-accepted. Therefore, our beliefs about reality, bivalence, choice and consistency should all be aligned.

In his groundbreaking book, Thin Objects, Linnebo (2018) argues for an account of neo-Fregean abstraction principles and thin existence that does not rely on analyticity or conceptual rules. It instead relies on a metaphysical notion he calls “sufficiency”. In this short discussion, I defend the analytic or conceptual rule account of thin existence.

A critique of Shaughan Lavine's attempt in /Understanding the Infinite/ to reduce talk about the infinite to finitely comprehensible terms.

On a widespread naturalist view, the meanings of mathematical terms are determined, and can only be determined, by the way we use mathematical language—in particular, by the basic mathematical principles we’re disposed to accept. But it’s mysterious how this can be so, since, as is well known, minimally strong first-order theories are non-categorical and so are compatible with countless non-isomorphic interpretations. As for second-order theories: though they typically enjoy categoricity results—for instance, Dedekind’s categoricity theorem for second-order and Zermelo’s quasi-categoricity theorem (...) for second-order —these results require full second-order logic. So appealing to these results seems only to push the problem back, since the principles of second-order logic are themselves non-categorical: those principles are compatible with restricted interpretations of the second-order quantifiers on which Dedekind’s and Zermelo’s results are no longer available. In this paper, we provide a naturalist-friendly, non-revisionary solution to an analogous but seemingly more basic problem—Carnap’s Categoricity Problem for propositional and first-order logic—and show that our solution generalizes, giving us full second-order logic and thereby securing the categoricity or quasi-categoricity of second-order mathematical theories. Briefly, the first-order quantifiers have their intended interpretation, we claim, because we’re disposed to follow the quantifier rules in an open-ended way. As we show, given this open-endedness, the interpretation of the quantifiers must be permutation-invariant and so, by a theorem recently proved by Bonnay and Westerståhl, must be the standard interpretation. Analogously for the second-order case: we prove, by generalizing Bonnay and Westerståhl’s theorem, that the permutation invariance of the interpretation of the second-order quantifiers, guaranteed once again by the open-endedness of our inferential dispositions, suffices to yield full second-order logic. (shrink)

There is no preferred reduction of number theory to set theory. Nonetheless, we confidently accept axioms obtained by substituting formulas from the language of set theory into the induction axiom schema. This is only possible, it is argued, because our acceptance of the induction axioms depends solely on the meanings of aritlunetical and logical terms, which is only possible if our 'intended models' of number theory are standard. Similarly, our acceptance of the second-order natural deduction rules depends solely on the (...) meanings of the logical terms, which implies, it is argued, that our second-order quantifiers have to be standard. (shrink)

Cantor argued that absolute infinity is beyond mathematical comprehension. His arguments imply that the domain of mathematics cannot be grasped by mathematical means. We argue that this inability constitutes a foundational problem. For Cantor, however, the domain of mathematics does not belong to mathematics, but to theology. We thus discuss the theological significance of Cantor’s treatment of absolute infinity and show that it can be interpreted in terms of negative theology. Proceeding from this interpretation, we refer to the recent debate (...) on absolute generality and argue that the method of diagonalization constitutes a modern version of the vianegativa. On our reading, negative theology can evoke an attitude of humility with respect to the boundedness of the human condition. Along these lines, we think that the foundational problem of mathematics concerning its domain can be addressed through a methodological attitude of humility. (shrink)

Neste pequeno artigo, analiso como a intuição geométrica estava presente no desenvolvimento seminal da teoria cantoriana dos conjuntos. Deste fato, decorre que a noção de conjunto ou de número transfinito não era tratada por Cantor como algo que merecesse uma fundamentação lógica. Os paradoxos que surgiram na teoria de Cantor são fruto de tal descompromisso inicial, e as tentativas ulteriores de resolvê-los fizeram com que aspectos intuitivos e esperados sobre os conjuntos ou infinito se perdessem. Em especial, observa-se aqui as (...) consequências “não geométricas” do axioma da construtibilidade de Gödel. (shrink)

Philosophy and Phenomenological Research, Volume 103, Issue 3, Page 547-566, November 2021.

This paper focuses on the categoricity of arithmetic and determinacy of arithmetical truth. Several ‘internal’ categoricity results have been discussed in the recent literature. Against the background of the philosophical position called internalism, we propose and investigate truth-theoretic versions of internal categoricity based on a primitive truth predicate. We argue for the compatibility of a primitive truth predicate with internalism and provide a novel argument for (and proof of) a truth-theoretic version of internal categoricity and internal determinacy with some positive (...) properties. (shrink)

Reflection principles are of central interest in the development of axiomatic theories. Whereas they are independent statements they appear to have a specific epistemological status. Our trust in those principles is as warranted as our trust in the axioms of the system itself. This paper is an attempt in clarifying this special epistemic status. We provide a motivation for the adoption of uniform reflection principles by their analogy to a form of the constructive \(\omega \) -rule. Additionally, we analyse the (...) role of informal arithmetic and the conception of natural numbers as an inductive structure, also with regard to extra conceptual resources such as a primitive truth predicate. (shrink)

W. Tait, The provenance of pure reason. Essays in the philosophy of mathematics and its history. New York: Oxford University Press, 2005. ix + 332 pp. £36.50. ISBN 0-19-514192-X. Reviewed by J. W....

Computational complexity theory is a subfield of computer science originating in computability theory and the study of algorithms for solving practical mathematical problems. Amongst its aims is classifying problems by their degree of difficulty — i.e., how hard they are to solve computationally. This paper highlights the significance of complexity theory relative to questions traditionally asked by philosophers of mathematics while also attempting to isolate some new ones — e.g., about the notion of feasibility in mathematics, the $\mathbf{P} \neq \mathbf{NP}$ (...) problem and why it has proven hard to resolve, and the role of non-classical modes of computation and proof. (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.

I argue that absolutism, the view that absolutely unrestricted quantification is possible, is to blame for both the paradoxes that arise in naive set theory and variants of these paradoxes that arise in plural logic and in semantics. The solution is restrictivism, the view that absolutely unrestricted quantification is not possible. -/- It is generally thought that absolutism is true and that restrictivism is not only false, but inexpressible. As a result, the paradoxes are blamed, not on illicit quantification, but (...) on the logical conception of set which motivates naive set theory. The accepted solution is to replace this with the iterative conception of set. -/- I show that this picture is doubly mistaken. After a close examination of the paradoxes in chapters 2--3, I argue in chapters 4 and 5 that it is possible to rescue naive set theory by restricting quantification over sets and that the resulting restrictivist set theory is expressible. In chapters 6 and 7, I argue that it is the iterative conception of set and the thesis of absolutism that should be rejected. (shrink)