This paper explores the relationship borne by the traditional paradoxes of set theory and semantics to formal incompleteness phenomena. A central tool is the application of the Arithmetized Completeness Theorem to systems of second-order arithmetic and set theory in which various “paradoxical notions” for first-order languages can be formalized. I will first discuss the setting in which this result was originally presented by Hilbert & Bernays (1939) and also how it was later adapted by Kreisel (1950) and Wang (1955) in (...) order to obtain formal undecidability results. A generalization of this method will then be presented whereby Russell’s paradox, a variant of Mirimanoff’s paradox, the Liar, and the Grelling–Nelson paradox may be uniformly transformed into incompleteness theorems. Some additional observations are then framed relating these results to the unification of the set theoretic and semantic paradoxes, the intensionality of arithmetization (in the sense of Feferman, 1960), and axiomatic theories of truth. (shrink)

A globally expressivist analysis of the indicative conditional based on the Ramsey Test is presented. The analysis is a form of ‘global’ expressivism in that it supplies acceptance and rejection conditions for all the sentence forming connectives of propositional logic (negation, disjunction, etc.) and so allows the conditional to embed in arbitrarily complex sentences (thus avoiding the Frege–Geach problem). The expressivist framework is semantically characterized in a restrictor semantics due to Vann McGee, and is completely axiomatized in a logic dubbed (...) ICL (‘Indicative Conditional Logic’). The expressivist framework extends the AGM (after Alchourron, Gärdenfors, Makinson) framework for belief revision and so provides a categorical (‘yes’–‘no’) epistemology for conditionals that complements McGee’s probabilistic framework while drawing on the same semantics. The result is an account of the semantics and acceptability conditions of the indicative conditional that fits well with the linguistic data (as pooled by linguists and from psychological experiments) while integrating both expressivist and semanticist perspectives. (shrink)

We present recent results on the model companions of set theory, placing them in the context of a current debate in the philosophy of mathematics. We start by describing the dependence of the notion of model companionship on the signature, and then we analyze this dependence in the specific case of set theory. We argue that the most natural model companions of set theory describe (as the signature in which we axiomatize set theory varies) theories of $H_{\kappa ^+}$, as $\kappa (...) $ ranges among the infinite cardinals. We also single out $2^{\aleph _0}=\aleph _2$ as the unique solution of the continuum problem which can (and does) belong to some model companion of set theory (enriched with large cardinal axioms). While doing so we bring to light that set theory enriched by large cardinal axioms in the range of supercompactness has as its model companion (with respect to its first order axiomatization in certain natural signatures) the theory of $H_{\aleph _2}$ as given by a strong form of Woodin’s axiom $(*)$ (which holds assuming $\mathsf {MM}^{++}$ ). Finally this model-theoretic approach to set-theoretic validities is explained and justified in terms of a form of maximality inspired by Hilbert’s axiom of completeness. (shrink)

One prominent criticism of the abstractionist program is the so-called Bad Company objection. The complaint is that abstraction principles cannot in general be a legitimate way to introduce mathematical theories, since some of them are inconsistent. The most notorious example, of course, is Frege’s Basic Law V. A common response to the objection suggests that an abstraction principle can be used to legitimately introduce a mathematical theory precisely when it is stable: when it can be made true on all sufficiently (...) large domains. In this paper, we raise a worry for this response to the Bad Company objection. We argue, perhaps surprisingly, that it requires very strong assumptions about the range of the second-order quantifiers; assumptions that the abstractionist should reject. (shrink)

Bernard Bolzano (1781–1848) is commonly thought to have attempted to develop a theory of size for infinite collections that follows the so-called part–whole principle, according to which the whole is always greater than any of its proper parts. In this paper, we develop a novel interpretation of Bolzano’s mature theory of the infinite and show that, contrary to mainstream interpretations, it is best understood as a theory of infinite sums. Our formal results show that Bolzano’s infinite sums can be equipped (...) with the rich and original structure of a non-commutative ordered ring, and that Bolzano’s views on the mathematical infinite are, after all, consistent. (shrink)

Free choice sequences play a key role in the intuitionistic theory of the continuum and especially in the theorems of intuitionistic analysis that conflict with classical analysis, leading many classical mathematicians to reject the concept of a free choice sequence. By treating free choice sequences as potentially infinite objects, however, they can be comfortably situated alongside classical analysis, allowing a rapprochement of these two mathematical traditions. Building on recent work on the modal analysis of potential infinity, I formulate a modal (...) theory of the free choice sequences known as lawless sequences. Intrinsically well-motivated axioms for lawless sequences are added to a background theory of classical second-order arithmetic, leading to a theory I call $MC_{LS}$. This theory interprets the standard intuitionistic theory of lawless sequences and is conservative over the classical background theory. (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)

Charlotte Angas Scott (1858–1932) was an internationally renowned geometer, the first British woman to earn a doctorate in mathematics, and the chair of the Bryn Mawr mathematics department for forty years. There she helped shape the burgeoning mathematics community in the United States. Scott often motivated her research as providing a “geometric treatment” of results that had previously been derived algebraically. The adjective “geometric” likely entailed many things for Scott, from her careful illustration of diagrams to her choice of references (...) and citations. This article will focus on Scott’s striking and consistent use of geometric to describe a reality of dynamic points, lines, planes, and spaces that could be manipulated analogously to physical objects. By providing geometric interpretations of algebraic derivations, Scott committed to an early-nineteenth-century aesthetic vision of a “whole” analytical geometry that she adapted to modern research areas. (shrink)

After discussing the limitations inherent to all set-theoretic reflection principles akin to those studied by A. Lévy et. al. in the 1960s, we introduce new principles of reflection based on the general notion of Structural Reflection and argue that they are in strong agreement with the conception of reflection implicit in Cantor’s original idea of the unknowability of the Absolute, which was subsequently developed in the works of Ackermann, Lévy, Gödel, Reinhardt, and others. We then present a comprehensive survey of (...) results showing that different forms of the new principle of Structural Reflection are equivalent to well-known large cardinal axioms covering all regions of the large-cardinal hierarchy, thereby justifying the naturalness of the latter. (shrink)

Is it possible to maintain classical logic, stay close to classical semantics, and yet accept that language might be semantically indeterminate? The article gives an affirmative answer by Ramsifying classical semantics, which yields a new semantic theory that remains much closer to classical semantics than supervaluationism but which at the same time avoids the problematic classical presupposition of semantic determinacy. The resulting Ramsey semantics is developed in detail, it is shown to supply a classical concept of truth and to fully (...) support the rules and metarules of classical logic, and it is applied to vague terms as well as to theoretical or open-ended terms from mathematics and science. The theory also demonstrates how diachronic or synchronic interpretational continuity across languages is compatible with semantic indeterminacy. (shrink)

This paper puts forward a new account of rigorous mathematical proof and its epistemology. One novel feature is a focus on how the skill of reading and writing valid proofs is learnt, as a way of understanding what validity itself amounts to. The account is used to address two current questions in the literature: that of how mathematicians are so good at resolving disputes about validity, and that of whether rigorous proofs are necessarily formalizable.

Recent discussions on Fregean and neo-Fregean foundations for arithmetic and real analysis pay much attention to what is called either ‘Application Constraint’ ($AC$) or ‘Frege Constraint’ ($FC$), the requirement that a mathematical theory be so outlined that it immediately allows explaining for its applicability. We distinguish between two constraints, which we, respectively, denote by the latter of these two names, by showing how$AC$generalizes Frege’s views while$FC$comes closer to his original conceptions. Different authors diverge on the interpretation of$FC$and on whether it (...) applies to definitions of both natural and real numbers. Our aim is to trace the origins of$FC$and to explore how different understandings of it can be faithful to Frege’s views about such definitions and to his foundational program. After rehearsing the essential elements of the relevant debate (§1), we appropriately distinguish$AC$from$FC$(§2). We discuss six rationales which may motivate the adoption of different instances of$AC$and$FC$(§3). We turn to the possible interpretations of$FC$(§4), and advance a Semantic$FC$(§4.1), arguing that while it suits Frege’s definition of natural numbers (4.1.1), it cannot reasonably be imposed on definitions of real numbers (§4.1.2), for reasons only partly similar to those offered by Crispin Wright (§4.1.3). We then rehearse a recent exchange between Bob Hale and Vadim Batitzky to shed light on Frege’s conception of real numbers and magnitudes (§4.2). We argue that an Architectonic version of$FC$is indeed faithful to Frege’s definition of real numbers, and compatible with his views on natural ones. Finally, we consider how attributing different instances of$FC$to Frege and appreciating the role of the Architectonic$FC$can provide a more perspicuous understanding of his foundational program, by questioning common pictures of his logicism (§5). (shrink)

The spiritus asper as used by Frege in a letter to Russell from 1904 bears resemblance to Church’s lambda. It is natural to ask how they relate to each other. An alternative approach to functional abstraction developed by Per Martin-Löf some thirty years ago allows us to describe the relationship precisely. Frege’s spiritus asper provides a way of restructuring a unary function name in Frege’s sense such that the argument place indicator occurs all the way to the right. Martin-Löf’s alternative (...) approach shows that this is only half of what lambda does. The other half is the deletion of the argument place indicator, resulting in what Frege would have called an isolated function name. (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)

We explain and explore class-theoretic potentialism—the view that one can always individuate more classes over a set-theoretic universe. We examine some motivations for class-theoretic potentialism, before proving some results concerning the relevant potentialist systems (in particular exhibiting failures of the $\mathsf {.2}$ and $\mathsf {.3}$ axioms). We then discuss the significance of these results for the different kinds of class-theoretic potentialists.

The purpose of this article is to explore the extent to which mathematics is subject to open texture and the extent to which mathematics resists open texture. The resistance is tied to the importance of proof and, in particular, rigor, in mathematics.

A thriving literature has developed over logical and mathematical pluralism – i.e. the views that several rival logical and mathematical theories can be equally correct. These have unfortunately grown separate; instead, they both could gain a great deal by a closer interaction. Our aim is thus to present some novel forms of abstractionist mathematical pluralism which can be modeled on parallel ways of substantiating logical pluralism (also in connection with logical anti-exceptionalism). To do this, we start by discussing the Good (...) Company Problem for neo-logicists recently raised by Paolo Mancosu (2016), concerning the existence of rival abstractive definitions of cardinal number which are nonetheless equally able to reconstruct Peano Arithmetic. We survey Mancosu’s envisaged possible replies to this predicament, and suggest as a further path the adoption of some form of mathematical pluralism concerning abstraction principles. We then explore three possible ways of substantiating such pluralism—Conceptual Pluralism, Domain Pluralism, Pluralism about Criteria—showing how each of them can be related to analogous proposals in the philosophy of logic. We conclude by considering advantages, concerns, and theoretical ramifications for these varieties of mathematical pluralism. (shrink)

Jean Nicod (1893–1924) is a French philosopher and logician who worked with Russell during the First World War. His PhD, with a preface from Russell, was published under the title La géométrie dans le monde sensible in 1924, the year of his untimely death. The book did not have the impact he deserved. In this paper, I discuss the methodological aspect of Nicod’s approach. My aim is twofold. I would first like to show that Nicod’s definition of various notions of (...) equivalence between theories anticipates, in many respects, the (syntactic and semantic) model-theoretic notion of interpretation of a theory into another. I would secondly like to present the philosophical agenda that led Nicod to elaborate his logical framework: the defense of rationalism against Bergson’s attacks. (shrink)

Purity is known as an ideal of proof that restricts a proof to notions belonging to the ‘content’ of the theorem. In this paper, our main interest is to develop a conception of purity for formal (natural deduction) proofs. We develop two new notions of purity: one based on an ontological notion of the content of a theorem, and one based on the notions of surrogate ontological content and structural content. From there, we characterize which (classical) first-order natural deduction proofs (...) of a mathematical theorem are pure. Formal proofs that refer to the ontological content of a theorem will be called ‘fully ontologically pure’. Formal proofs that refer to a surrogate ontological content of a theorem will be called ‘secondarily ontologically pure’, because they preserve the structural content of a theorem. We will use interpretations between theories to develop a proof-theoretic criterion that guarantees secondary ontological purity for formal proofs. (shrink)

We take Carnap’s problem to be to what extent standard consequence relations in various formal languages fix the meaning of their logical vocabulary, alone or together with additional constraints on the form of the semantics. This paper studies Carnap’s problem for basic modal logic. Setting the stage, we show that neighborhood semantics is the most general form of compositional possible worlds semantics, and proceed to ask which standard modal logics (if any) constrain the box operator to be interpreted as in (...) relational Kripke semantics. Except when restricted to finite domains, no modal logic characterizes all the Kripkean interpretation of P. Moreover, we show that, in contrast with the case of first-order logic, the obvious requirement of permutation invariance is not adequate in the modal case. After pointing out some known facts about modal logics that nevertheless force the Kripkean interpretation, we focus on another feature often taken to embody the gist of modal logic: locality. We show that invariance under point-generated subframes (properly defined) does single out the Kripkean interpretations, but only among topological interpretations, not in general. Finally, we define a notion of bisimulation invariance — another aspect of locality — that, together with a reasonable closure condition, gives the desired general result. Along the way, we propose a new perspective on normal neighborhood frames as filter frames, consisting of a set of worlds equipped with an accessibility relation, and a free filter at every world. (shrink)

Jean Nicod (1893–1924) is a French philosopher and logician who worked with Russell during the First World War. His PhD, with a preface from Russell, was published under the titleLa géométrie dans le monde sensiblein 1924, the year of his untimely death. The book did not have the impact he deserved. In this paper, I discuss the methodological aspect of Nicod’s approach. My aim is twofold. I would first like to show that Nicod’s definition of various notions of equivalence between (...) theories anticipates, in many respects, the (syntactic and semantic) model-theoretic notion of interpretation of a theory into another. I would secondly like to present the philosophical agenda that led Nicod to elaborate his logical framework: the defense of rationalism against Bergson’s attacks. (shrink)

In this article, I develop a novel version of the multiverse theory of sets called hierarchical pluralism by introducing the notion of “degrees of intentionality” of theories. The presented view is articulated for the purpose of reconciling epistemological realism and the multiverse theory of sets so as to preserve a considerable amount of epistemic objectivity when working with the multiverse theory. I give some arguments in favor of a hierarchical picture of the multiverse in which theories or models are thought (...) to be ordered with respect to their plausibility as a manifestation of endorsing the idea that some set theories are more plausible than others. The proposed multiverse account settles the pluralist’s dilemma, the dichotomy that there is a trade-off between the richness of mathematical ontology and the objectivity of mathematical truth. The view also extends and serves as an alternative position to Balaguer’s intention-based Platonism, from which he claims that a certain version of mathematical pluralism follows. (shrink)

The interplay of philosophical ambitions and technical reality have given birth to rich and interesting approaches to explain the oft-claimed special character of mathematical and logical knowledge. Two projects stand out both for their audacity and their innovativeness. These are logicism and proof-theoretic semantics. This dissertation contains three chapters exploring the limits of these two projects. In both cases I find the formal results offer a mixed blessing to the philosophical projects. Chapter 1. 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. I 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. I 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. Chapter 2. There have been several recent results bringing into focus the super-intuitionistic nature of most notions of proof-theoretic validity. But there has been very little work evaluating the consequences of these results. In this chapter, I explore the question of whether these results undermine the claim that proof-theoretic validity shows us which inferences follow from the meaning of the connectives when defined by their introduction rules. It is argued that the super-intuitionistic inferences are valid due to the correspondence between the treatment of the atomic formulas and more complex formulas. And so the goals of proof-theoretic validity are not undermined. Chapter 3. Prawitz (1971) conjectured that proof-theoretic validity offers a semantics for intuitionistic logic. This conjecture has recently been proven false by Piecha and Schroeder-Heister (2019). This chapter resolves one of the questions left open by this recent result by showing the extensional alignment of proof-theoretic validity and general inquisitive logic. General inquisitive logic is a generalisation of inquisitive semantics, a uniform semantics for questions and assertions. The chapter further defines a notion of quasi-proof-theoretic validity by restricting proof-theoretic validity to allow double negation elimination for atomic formulas and proves the extensional alignment of quasi-proof-theoretic validity and inquisitive logic.Abstract prepared by Will Stafford extracted partially from the dissertation. (shrink)