According to Weyl, “‘inexhaustibility’ is essential to the infinite”. However, he distinguishes two kinds of inexhaustible, or merely potential, domains: those that are “extensionally determinate” and those that are not. This article clarifies Weyl's distinction and explains its enduring logical and philosophical significance. The distinction sheds lights on the contemporary debate about potentialism, which in turn affords a deeper understanding of Weyl.

Hermann's Weyl Das Kontinuum has inspired several studies in logic and foundations of mathematics over the last century. The book provides a remarkable reconstruction of a large portion of classical mathematics on a predicative basis. However, diverging interpretations of the predicative system formulated by Weyl have been proposed in the literature. In the present work, I analyze an early formalization of Weyl's ideas proposed by [Casari, E. 1964. Questioni di Filosofia Della Matematica, Milano: Feltrinelli] and compare it with other, more (...) well-known, accounts, such as those proposed respectively by Feferman and Avron. In this way, I fill a gap in the literature on Weyl's predicative mathematics by shedding light on an interpretation that has never been studied. Moreover, Casari's work is plausibly the first systematic reconstruction of Weyl's system. In particular, I highlight the different insights about predicativity that can be found in Weyl's work. Casari's reconstruction focuses on the logical and mathematical processes described by Weyl in the first part of his book. Through the analysis of this unexplored perspective, I shed light on fundamental aspects of Weyl's work and elucidate the alleged ambiguities it presents. In particular, in line with Avron's most recent reconstruction of Weyl's ideas, this analysis supports a stronger conception of predicativity than what is commonly attributed to Weyl in the literature. As a result, this work not only provides an analysis of a neglected interpretation of Das Kontinuum, but also contributes to elucidating Weyl's classical conception of predicativity. (shrink)

Modal logic provides an elegant way to understand the notion of potential infinity. This raises the question of what the right modal logic is for reasoning about potential infinity. In this article I identify a choice point in determining the right modal logic: Can a potentially infinite collection ever be expanded in two mutually incompatible ways? If not, then the possible expansions are convergent; if so, then the possible expansions are branching. When possible expansions are convergent, the right modal logic (...) is S4.2, and a mirroring theorem due to Linnebo allows for a natural potentialist interpretation of mathematical discourse. When the possible expansions are branching, the right modal logic is S4. However, the usual box and diamond do not suffice to express everything the potentialist wants to express. I argue that the potentialist also needs an operator expressing that something will eventually happen in every possible expansion. I prove that the result of adding this operator to S4 makes the set of validities Pi-1-1 hard. This result makes it unlikely that there is any natural translation of ordinary mathematical discourse into the potentialist framework in the context of branching possibilities. (shrink)

A paradox about sets of properties is presented. The paradox, which invokes an impredicatively defined property, is formalized in a free third-order logic with lambda-abstraction, through a classically proof-theoretically valid deduction of a contradiction from a single premise to the effect that every property has a unit set. Something like a model is offered to establish that the premise is, although classically inconsistent, nevertheless consistent, so that the paradox discredits the logic employed. A resolution through the ramified theory of types (...) is considered. Finally, a general scheme that generates a family of analogous paradoxes and a generally applicable resolution are proposed. (shrink)

Is a logicist bound to the claim that as a matter of analytic truth there is an actual infinity of objects? If Hume’s Principle is analytic then in the standard setting the answer appears to be yes. Hodes’s work pointed to a way out by offering a modal picture in which only a potential infinity was posited. However, this project was abandoned due to apparent failures of cross-world predication. We re-explore this idea and discover that in the setting of the (...) potential infinite one can interpret first-order Peano arithmetic, but not second-order Peano arithmetic. We conclude that in order for the logicist to weaken the metaphysically loaded claim of necessary actual infinities, they must also weaken the mathematics they recover. (shrink)

Most paradoxes of self-reference have a dual or ‘hypodox’. The Liar paradox (Lr = ‘Lr is false’) has the Truth-Teller (Tt = ‘Tt is true’). Russell’s paradox, which involves the set of sets that are not self-membered, has a dual involving the set of sets which are self-membered, etc. It is widely believed that these duals are not paradoxical or at least not as paradoxical as the paradoxes of which they are duals. In this paper, I argue that some paradox’s (...) duals or hypodoxes are as paradoxical as the paradoxes of which they are duals, and that they raise neglected and interestingly different problems. I first focus on Richard’s paradox (arguably the simplest case of a paradoxical dual), showing both that its dual is as paradoxical as Richard’s paradox itself, and that the classical, Richard-Poincaré solution to the latter does not generalize to the former in any obvious way. I then argue that my argument applies mutatis mutandis to other paradoxes of self-reference as well, the dual of the Liar (the Truth-Teller) proving paradoxical. (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)

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.

Most philosophers take Benacerraf’s argument in ‘What numbers could not be’ to rebut successfully the reductionist view that numbers are sets. This philosophical consensus jars with mathematical practice, in which reductionism continues to thrive. In this note, we develop a new challenge to Benacerraf’s argument by contesting a central premise which is almost unanimously accepted in the literature. Namely, we argue that — contra orthodoxy — there are metaphysically relevant reasons to prefer von Neumann ordinals over other set-theoretic reductions of (...) arithmetic. In doing so, we provide set-theoretical facts which, we believe, are crucial for informed assessment of reductionism. (shrink)

Inspired by Cantor's Theorem (CT), orthodoxy takes infinities to come in different sizes. The orthodox view has had enormous influence in mathematics, philosophy, and science. We will defend the contrary view---Countablism---according to which, necessarily, every infinite collection (set or plurality) is countable. We first argue that the potentialist or modal strategy for treating Russell's Paradox, first proposed by Parsons (2000) and developed by Linnebo (2010, 2013) and Linnebo and Shapiro (2019), should also be applied to CT, in a way that (...) vindicates Countabilism. Our discussion dovetails with recent independently developed treatments of CT in Meadows (2015), Pruss (2020), and Scambler (2021), aimed at establishing the mathematical viability, and therefore epistemic possibility, of Countabilism. Unlike these authors, our goal isn't to vindicate the mathematical underpinnings of Countabilism. Rather, we aim to argue that, given that Countabilism is mathematically viable, Countabilism should moreover be regarded as true. After clarifying the modal content of Countabilism, we canvas some of Countabilism's many positive implications, including that Countabilism provides the best account of the pervasive independence phenomena in set theory, and that Countabilism has the power to defuse several persistent puzzles and paradoxes found in physics and metaphysics. We conclude that in light of its theoretical and explanatory advantages, Countabilism is more likely true than not. (shrink)

A definition of a property P is impredicative if it quantifies over a domain to which P belongs. Due to influential arguments by Ramsey and Gödel, impredicative mathematics is often thought to possess special metaphysical commitments. It seems that an impredicative definition of a property P does not have the intended meaning unless P already exists, suggesting that the existence of P cannot depend on its explicit definition. Carnap (1937 [1934], p. 164) argues, however, that accepting impredicative definitions amounts to (...) choosing a "form of language" and is free from metaphysical implications. This paper explains this view in its historical context. I discuss the development of Carnap’s thought on the foundations of mathematics from the mid-1920s to the mid-1930s, concluding with an account of Carnap’s (1937 [1934]) non-Platonistic defense of impredicativity. This discussion is also important for understanding Carnap’s influential views on ontology more generally, since Carnap’s (1937 [1934]) view, according to which accepting impredicative definitions amounts to choosing a "form of language", is an early precursor of the view Carnap presents in "Empiricism, Semantics and Ontology" (1956 [1950]), according to which referring to abstract entities amounts to accepting a "linguistic framework". (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)

Many are reluctant to accept primitive modality into their fundamental picture of the world. The worry often traces to this thought: we shouldn't adopt any more primitive - that is, unexplained - notions than we need in order to explain all the features of the world, and primitive modal notions are not needed. I examine one prominent rival to modal primitivism, combinatorialism, and show that in order to account for all the modal features of the world the combinatorialist must adopt (...) two additional primitive notions. My own modal primitivist view takes as primitive the notion of incompatibility between properties or relations. I show how the non-modal notions that the combinatorialist must adopt as primitive may be analyzed using my notion. The upshot is that with respect to the number of primitive notions, my modal primitivist theory comes out ahead. (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)

A variety of projects in proof theory of relevance to the philosophy of mathematics are surveyed, including Gödel's incompleteness theorems, conservation results, independence results, ordinal analysis, predicativity, reverse mathematics, speed-up results, and provability logics.

The representation of mathematical objects in terms of (more) basic ones is part and parcel of (the foundations of) mathematics. In the usual foundations of mathematics, namely, ZFC set theory, all mathematical objects are represented by sets, while ordinary, namely, non–set theoretic, mathematics is represented in the more parsimonious language of second-order arithmetic. This paper deals with the latter representation for the rather basic case of continuous functions on the reals and Baire space. We show that the logical strength of (...) basic theorems named after Tietze, Heine, and Weierstrass changes significantly upon the replacement of “second-order representations” by “third-order functions.” We discuss the implications and connections to the reverse mathematics program and its foundational claims regarding predicativist mathematics and Hilbert’s program for the foundations of mathematics. Finally, we identify the problem caused by representations of continuous functions and formulate a criterion to avoid problematic codings within the bigger picture of representations. (shrink)

Hermann Weyl was one of the greatest mathematicians of the 20th century, with contributions to many branches of mathematics and physics. In 1918 he wrote a famous book, “Das Kontinuum”, on the foundations of mathematics. In that book he described mathematical analysis as a ‘house built on sand’, and tried to ‘replace this shifting foundation with pillars of enduring strength’. In this paper we reexamine and explain the philosophical and mathematical ideas that underly Weyl’s system in “Das Kontinuum”, and show (...) that they are still useful and relevant. We propose a precise formalization of that system, which is the first to be completely faithful to what is written in the book. Finally, we suggest that a certain set-theoretical modern system reflects better Weyl’s ideas than previous attempts (most notably by Feferman) of achieving this goal. (shrink)

According to the implicit commitment thesis, once accepting a mathematical formal system S, one is implicitly committed to additional resources not immediately available in S. Traditionally, this thesis has been understood as entailing that, in accepting S, we are bound to accept reflection principles for S and therefore claims in the language of S that are not derivable in S itself. It has recently become clear, however, that such reading of the implicit commitment thesis cannot be compatible with well-established positions (...) in the foundations of mathematics which consider a specific theory S as self-justifying and doubt the legitimacy of any principle that is not derivable in S: examples are Tait’s finitism and the role played in it by Primitive Recursive Arithmetic, Isaacson’s thesis and Peano Arithmetic, Nelson’s ultrafinitism and sub-exponential arithmetical systems. This casts doubts on the very adequacy of the implicit commitment thesis for arithmetical theories. In the paper we show that such foundational standpoints are nonetheless compatible with the implicit commitment thesis. We also show that they can even be compatible with genuine soundness extensions of S with suitable form of reflection. The analysis we propose is as follows: when accepting a system S, we are bound to accept a fixed set of principles extending S and expressing minimal soundness requirements for S, such as the fact that the non-logical axioms of S are true. We call this invariant component the semantic core of implicit commitment. But there is also a variable component of implicit commitment that crucially depends on the justification given for our acceptance of S in which, for instance, may or may not appear reflection principles for S. We claim that the proposed framework regulates in a natural and uniform way our acceptance of different arithmetical theories. (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)

This article reports that some robustness of the notions of predicativity and of autonomous progression is broken down if as the given infinite total entity we choose some mathematical entities other than the traditionalω. Namely, the equivalence between normal transfinite recursion scheme and newdependent transfinite recursionscheme, which does hold in the context of subsystems of second order number theory, does not hold in the context of subsystems of second order set theory where the universeVof sets is treated as the given (...) totality. (shrink)

Consider one of several things. Is the one thing necessarily one of the several? This key question in the modal logic of plurals is clarified. Some defenses of an affirmative answer are developed and compared. Various remarks are made about the broader philosophical significance of the question.

We study the logical and computational properties of basic theorems of uncountable mathematics, including the Cousin and Lindelöf lemma published in 1895 and 1903. Historically, these lemmas were among the first formulations of open-cover compactness and the Lindelöf property, respectively. These notions are of great conceptual importance: the former is commonly viewed as a way of treating uncountable sets like e.g. [Formula: see text] as “almost finite”, while the latter allows one to treat uncountable sets like e.g. [Formula: see text] (...) as “almost countable”. This reduction of the uncountable to the finite/countable turns out to have a considerable logical and computational cost: we show that the aforementioned lemmas, and many related theorems, are extremely hard to prove, while the associated sub-covers are extremely hard to compute. Indeed, in terms of the standard scale (based on comprehension axioms), a proof of these lemmas requires at least the full extent of second-order arithmetic, a system originating from Hilbert–Bernays’ Grundlagen der Mathematik. This observation has far-reaching implications for the Grundlagen’s spiritual successor, the program of Reverse Mathematics, and the associated Gödel hierarchy. We also show that the Cousin lemma is essential for the development of the gauge integral, a generalization of the Lebesgue and improper Riemann integrals that also uniquely provides a direct formalization of Feynman’s path integral. (shrink)