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.

Jurado: Mario Gómez-Torrente (presidente), Miguel Ángel Fernández Vargas (vocal), Santiago Echeverri Saldarriaga (secretario). [Graduado con Mención Honorífica.].

This paper outlines an account of numbers based on the numerical equivalence schema (NES), which consists of all sentences of the form ‘#x.Fx=n if and only if ∃nx Fx’, where # is the number-of operator and ∃n is defined in standard Russellian fashion. In the first part of the paper, I point out some analogies between the NES and the T-schema for truth. In light of these analogies, I formulate a minimalist account of numbers, based on the NES, which strongly (...) parallels the minimalist (deflationary) account of truth. One may be tempted to develop the minimalist account in a fictionalist direction, according to which arithmetic is useful but untrue, if taken at face value. In the second part, I argue that this suggestion is not as attractive as it may first appear. The NES suffers from a similar problem to the T-schema: it is deductively weak and does not enable the derivation of any non-trivial generalizations. In the third part of the paper, I explore some strategies to deal with the generalization problem, again drawing inspiration from the literature on truth. In closing this paper, I briefly compare the minimalist to some other accounts of numbers. (shrink)

This paper presents a new approach to the class-theoretic paradoxes. In the first part of the paper, I will distinguish classes from sets, describe the function of class talk, and present several reasons for postulating type-free classes. This involves applications to the problem of unrestricted quantification, reduction of properties, natural language semantics, and the epistemology of mathematics. In the second part of the paper, I will present some axioms for type-free classes. My approach is loosely based on the Gödel–Russell idea (...) of limited ranges of significance. It is shown how to derive the second-order Dedekind–Peano axioms within that theory. I conclude by discussing whether the theory can be used as a solution to the problem of unrestricted quantification. In an appendix, I prove the consistency of the class theory relative to Zermelo–Fraenkel set theory. (shrink)

In two recent papers, Bob Hale has attempted to free second-order logic of the 'staggering existential assumptions' with which Quine famously attempted to saddle it. I argue, first, that the ontological issue is at best secondary: the crucial issue about second-order logic, at least for a neo-logicist, is epistemological. I then argue that neither Crispin Wright's attempt to characterize a `neutralist' conception of quantification that is wholly independent of existential commitment, nor Hale's attempt to characterize the second-order domain in terms (...) of definability, can serve a neo-logicist's purposes. The problem, in both cases, is similar: neither Wright nor Hale is sufficiently sensitive to the demands that impredicativity imposes. Finally, I defend my own earlier attempt to finesse this issue, in "A Logic for Frege's Theorem", from Hale's criticisms. (shrink)

Plural expressions found in natural languages allow us to talk about many objects simultaneously. Plural logic — a logical system that takes plurals at face value — has seen a surge of interest in recent years. This book explores its broader significance for philosophy, logic, and linguistics. What can plural logic do for us? Are the bold claims made on its behalf correct? After introducing plural logic and its main applications, the book provides a systematic analysis of the relation between (...) this logic and other theoretical frameworks such as set theory, mereology, higher-order logic, and modal logic. The applications of plural logic rely on two assumptions, namely that this logic is ontologically innocent and has great expressive power. These assumptions are shown to be problematic. The result is a more nuanced picture of plural logic's applications than has been given thus far. Questions about the correct logic of plurals play a central role in the final chapters, where traditional plural logic is rejected in favor of a "critical" alternative. The most striking feature of this alternative is that there is no universal plurality. This leads to a novel approach to the relation between the many and the one. In particular, critical plural logic paves the way for an account of sets capable of solving the set-theoretic paradoxes. (shrink)

Sortal concepts are at the center of certain logical discussions and have played a significant role in solutions to particular problems in philosophy. Apart from logic and philosophy, the study of sortal concepts has found its place in specific fields of psychology, such as the theory of infant cognitive development and the theory of human perception. In this monograph, different formal logics for sortal concepts and sortal-related logical notions are characterized. Most of these logics are intensional in nature and possess, (...) in addition, a bidimensional character. That is, they simultaneously represent two different logical dimensions. In most cases, the dimensions are those of time and natural necessity, and, in other cases, those of time and epistemic necessity. Another feature of the logics in question concerns second-order quantification over sortal concepts, a logical notion that is also represented in the logics. Some of the logics adopt a constant domain interpretation, others a varying domain interpretation of such quantification. Two of the above bidimensional logics are philosophically grounded on predication sortalism, that is, on the philosophical view that predication necessarily requires sortal concepts. Another bidimensional logic constitutes a logic for complex sortal predicates. These three sorts of logics are among the important novelties of this work since logics with similar features have not been developed up to now, and they might be instrumental for the solution of philosophically significant problems regarding sortal predicates. The book assumes a modern variant of conceptualism as a philosophical background. For this reason, the approach to sortal predicates is in terms of sortal concepts. Concepts, in general, are here understood as intersubjective realizable cognitive capacities. The proper features of sortal concepts are determined by an analysis of the main features of sortal predicates. Posterior to this analysis, the sortal-related logical notions represented in the above logics are discussed. There is also a discussion on the extent to which the set-theoretic formal semantic systems of the book capture different aspects of the conceptualist approach to sortals. These different semantic frameworks are also related to realist and nominalist approaches to sortal predicates, and possible modifications to them are considered that might represent those alternative approaches. (shrink)

We develop the theory of partial satisfaction relations for structures that may be proper classes and define a satisfaction predicate ($\models^*$) appropriate to such structures. We indicate the utility of this theory as a framework for the development of the metatheory of first-order predicate logic and set theory, and we use it to prove that for any recursively enumerable extension $\Theta$ of ZF there is a finitely axiomatizable extension $\Theta'$ of GB that is a conservative extension of $\Theta$. We also (...) prove a conservative extension result that justifies the use of $\models^*$ to characterize ground models for forcing constructions. (shrink)

Thought: A Journal of Philosophy, EarlyView.

When viewed as the most comprehensive theory of collections, set theory leaves no room for classes. But the vocabulary of classes, it is argued, provides us with compact and, sometimes, irreplaceable formulations of largecardinal hypotheses that are prominent in much very important and very interesting work in set theory. Fortunately, George Boolos has persuasively argued that plural quantification over the universe of all sets need not commit us to classes. This paper suggests that we retain the vocabulary of classes, but (...) explain that what appears to be singular reference to classes is, in fact, covert plural reference to sets. (shrink)

According to the iterative conception of sets, standardly formalized by ZFC, there is no set of all sets. But why is there no set of all sets? A simple-minded, though unpopular, “minimal” explanation for why there is no set of all sets is that the supposition that there is contradicts some axioms of ZFC. In this paper, I first explain the core complaint against the minimal explanation, and then argue against the two main alternative answers to the guiding question. I (...) conclude the paper by outlining a close alternative to the minimal explanation, the conception-based explanation, that avoids the core complaint against the minimal explanation. (shrink)

Call a quantifier ‘unrestricted’ if it ranges over absolutely all objects. Arguably, unrestricted quantification is often presupposed in philosophical inquiry. However, developing a semantic theory that vindicates unrestricted quantification proves rather difficult, at least as long as we formulate our semantic theory within a classical first-order language. It has been argued that using a type theory as framework for our semantic theory provides a resolution of this problem, at least if a broadly Fregean interpretation of type theory is assumed. However, (...) the intelligibility of this interpretation has been questioned. In this paper I introduce a type-free theory of properties that can also be used to vindicate unrestricted quantification. This alternative emerges very naturally by reflecting on the features on which the type-theoretic solution of the problem of unrestricted quantification relies. Although this alternative theory is formulated in a non-classical logic, it preserves the deductive strength of classical strict type theory in a natural way. The ideas developed in this paper make crucial use of Russell’s notion of range of significance. (shrink)

This paper outlines an account of numbers based on the numerical equivalence schema, which consists of all sentences of the form ‘#x.Fx=n if and only if ∃nx Fx’, where # is the number-of operator and ∃n is defined in standard Russellian fashion. In the first part of the paper, I point out some analogies between the NES and the T-schema for truth. In light of these analogies, I formulate a minimalist account of numbers, based on the NES, which strongly parallels (...) the minimalist account of truth. One may be tempted to develop the minimalist account in a fictionalist direction, according to which arithmetic is useful but untrue, if taken at face value. In the second part, I argue that this suggestion is not as attractive as it may first appear. The NES suffers from a similar problem to the T-schema: it is deductively weak and does not enable the derivation of any non-trivial generalizations. In the third part of the paper, I explore some strategies to deal with the generalization problem, again drawing inspiration from the literature on truth. In closing this paper, I briefly compare the minimalist to some other accounts of numbers. (shrink)

In this paper we study several translations that map models and formulae of the language of second-order arithmetic to models and formulae of the language of truth. These translations are useful because they allow us to exploit results from the extensive literature on arithmetic to study the notion of truth. Our purpose is to present these connections in a systematic way, generalize some well-known results in this area, and to provide a number of new results. Sections 3 and 4 contain (...) some recursion- and proof-theoretic results about Kripke-style fixed-point theories of truth. Section 5 shows how to derive full second-order arithmetic from principles of truth. Section 6 investigates the proof-theoretic strength of disquotation without an arithmetical base theory. (shrink)

We consider certain predicative classes with respect to their bearing on set theory, namely on its semantics, and on its ontological power. On the one hand, our predicative classes will turn out to be perfectly suited for establishing a nice hierarchy of metalanguages starting from the usual set theoretical language. On the other hand, these classes will be seen to be fairly inappropriate for the formulation of strong principles of infinity. The motivation for considering this very type of classes is (...) a reasonable philosophy of set theory. Familiarity is assumed only with basic concepts of both set theory and its philosophy. (shrink)

In 1907, Alfred Stieglitz took what was to become one of his signature photographs, The Steerage. Stieglitz stood at the rear of the ocean liner Kaiser Wilhelm II and photographed the decks, first-class passengers above and steerage passengers below, carefully exposing the film to their reflected light. Later, in the darkroom, Stieglitz developed this film and made a number of prints from the resulting negative. The photograph is a familiar one, an enduring piece of social commentary, but what exactly is (...) The Steerage which Stieglitz has given us? It is clearer what The Steerage is not. It is distinct from each of its prints and from its negative. These may be dusty or torn without The Steerage being so, and any one of these could be destroyed without thereby destroying The Steerage itself. Nor is The Steerage the set of its prints. The set could not have had different members, while The Steerage could have had more, fewer, or different prints.1 Similar reasoning rules out the mereological sum of parts of its actual prints, for The Steerage’s prints might not have comprised just these parts. We are left with a puzzle, what sort of thing is a photograph? This puzzle is not unique to photography. Similar reasoning generates an analogous puzzle for any repeatable work of art. Novels, poems, plays, symphonies, songs, and the rest share an ontological predicament and create a 1 general puzzle concerning the ontological status of repeatable works of art. It is widely held that the puzzle has an equally general solution, one which I will argue fails for systematic reasons. Although my target here is the supposed solution to the general problem, photography will remain the central case under scrutiny. I offer it as a model for our thinking about the wider class in order to reap the benefits of thinking in terms of concrete cases. Although this risks a trade-off with the generality of my conclusions—there are important differences of detail between the cases—I hope it is clear that the considerations I appeal to in photography are not idiosyncratic but shared by the wider class.. (shrink)

Modal structuralism promises an interpretation of set theory that avoids commitment to abstracta. This article investigates its underlying assumptions. In the first part, I start by highlighting some shortcomings of the standard axiomatisation of modal structuralism, and propose a new axiomatisation I call MSST (for Modal Structural Set Theory). The main theorem is that MSST interprets exactly Zermelo set theory plus the claim that every set is in some inaccessible rank of the cumulative hierarchy. In the second part of the (...) article, I look at the prospects for supplementing MSST with a modal structural reflection principle, as suggested in Hellman (2015). I show that Hellman’s principle is inconsistent (Theorem 5.32), and argue that modal structural reflection principles in general are either incompatible with modal structuralism or extremely weak. (shrink)

The aim of this essay is to show that the subject-matter of ontology is richer than one might have thought. Our route will be indirect. We will argue that there are circumstances under which standard first-order regimentation is unacceptable, and that more appropriate varieties of regimentation lead to unexpected kinds of ontological commitment.

Forthcoming in Philosophical Compass. I explain why plural quantifiers and predicates have been thought to be philosophically significant.

Truth predicates are widely believed to be capable of serving a certain logical or quasi-logical function. There is little consensus, however, on the exact nature of this function. We offer a series of formal results in support of the thesis that disquotational truth is a device to simulate higher-order resources in a first-order setting. More specifically, we show that any theory formulated in a higher-order language can be naturally and conservatively interpreted in a first-order theory with a disquotational truth or (...) truth-of predicate. In the first part of the paper we focus on the relation between truth and full impredicative sentential quantification. The second part is devoted to the relation between truth-of and full impredicative predicate quantification. (shrink)

Logical orthodoxy has it that classical first-order logic, or some extension thereof, provides the right extension of the logical consequence relation. However, together with naïve but intuitive principles about semantic notions such as truth, denotation, satisfaction, and possibly validity and other naïve logical properties, classical logic quickly leads to inconsistency, and indeed triviality. At least since the publication of Kripke’s Outline of a theory of truth , an increasingly popular diagnosis has been to restore consistency, or at least non-triviality, by (...) restricting some classical rules. Our modest aim in this note is to briefly introduce the main strands of the current debate on paradox and logical revision, and point to some of the potential challenges revisionary approaches might face, with reference to the nine contributions to the present volume.For a recent introduction to non-classical theories of truth and other semantic notions, see the excellent Beall a .. (shrink)

The Russellian argument against the possibility of absolutely unrestricted quantification can be answered by the partisan of that quantification in an apparently easy way, namely, arguing that the objects used in the argument do not exist because they are defined in a viciously circular fashion. We show that taking this contention along as a premise and relying on an extremely intuitive Principle of Determinacy, it is possible to devise a reductio of the possibility of absolutely unrestricted quantification. Therefore, there are (...) intuitive reasons to believe that the counter-argument fails to support the possibility of absolutely unrestricted quantification. (shrink)

Dummett’s notion of indefinite extensibility is influential but obscure. The notion figures centrally in an alternative Dummettian argument for intuitionistic logic and anti-realism, distinct from his more famous, meaning-theoretic arguments to the same effect. Drawing on ideas from Dummett, a precise analysis of indefinite extensibility is proposed. This analysis is used to reconstruct the poorly understood alternative argument. The plausibility of the resulting argument is assessed.

It can be shown by means of a paradox that, given the Principle of Sufficient Reason, there is no conjunction of all contingent truths. The question is, or ought to be, how to interpret that result: _Quid sibi velit?_ A celebrated argument against PSR due to Peter van Inwagen and Jonathan Bennett in effect interprets the result to mean that PSR entails that there are no contingent truths. But reflection on parallels in philosophy of mathematics shows it can equally be (...) interpreted either as a proof that there are "too many" contingent truths to combine in a single conjunction or as a proof that the concept _contingent truth_ is indefinitely extensible and there is no such thing as "all contingent truths." Either interpretation would reconcile PSR with contingent truth, but the natural rationales of those interpretations are at odds. This essay argues that the second interpretation is a more satisfactory explanation of why, if PSR is true, there should be no conjunction of all contingent truths. This sheds new light on the nature of the explanatory demand embedded in PSR and uncovers a number of surprising implications for the commitments of rationalism. (shrink)

Kripke showed how to restrict Tarski’s schema to grounded sentences. I examine the prospects for an analogous approach to the paradoxes of naive class comprehension. I present new methods to obtain theories of grounded classes and test them against antecedently motivated desiderata. My findings cast doubt on whether a theory of grounded classes can accommodate both the extensionality of classes and allow for class definition in terms of identity.

This paper investigates a set of issues connected with the so-called conservativeness argument against deflationism. Although I do not defend that argument, I think the discussion of it has raised some interesting questions about whether what I call “compositional principles,” such as “a conjunction is true iff its conjuncts are true,” have substantial content or are in some sense logically trivial. The paper presents a series of results that purport to show that the compositional principles for a first-order language, taken (...) together, have substantial logical strength, amounting to a kind of abstract consistency statement. (shrink)

This paper attempts to address the question what logical strength theories of truth have by considering such questions as: If you take a theory T and add a theory of truth to it, how strong is the resulting theory, as compared to T? Once the question has been properly formulated, the answer turns out to be about as elegant as one could want: Adding a theory of truth to a finitely axiomatized theory T is more or less equivalent to a (...) kind of abstract consistency statement. A large part of the interest of the paper lies in the way syntactic theories are 'disentangled' from object theories. (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)

This paper revisits a challenge for contextualist approaches to paradoxes such as the Liar paradox and Russell’s paradox. Contextualists argue that these paradoxes are to be resolved by appeal to context dependence. This can offer some nice and effective ways to avoid paradox. But there is a problem. Context dependence is, at least to begin with, a phenomenon in natural language. Is there really such context dependence as the solutions to paradoxes require, and is it really just a familiar linguistic (...) phenomenon at work? Not so clearly. In earlier work, I argued that the required form of context dependence does not look like our most familiar instances of context dependence in natural language. I called this extraordinary context dependence. In this paper, I shall explore, somewhat tentatively, a way that we can see the context dependence needed to address paradoxes as not so extraordinary. Doing so will also allow us to connect thinking about the context dependence of quantifier domains with some interesting ideas about the distinctive semantic properties of certain quantifiers. (shrink)

This paper revisits a challenge for contextualist approaches to paradoxes such as the Liar paradox and Russell’s paradox. Contextualists argue that these paradoxes are to be resolved by appeal to context dependence. This can offer some nice and effective ways to avoid paradox. But there is a problem. Context dependence is, at least to begin with, a phenomenon in natural language. Is there really such context dependence as the solutions to paradoxes require, and is it really just a familiar linguistic (...) phenomenon at work? Not so clearly. In earlier work, I argued that the required form of context dependence does not look like our most familiar instances of context dependence in natural language. I called this extraordinary context dependence. In this paper, I shall explore, somewhat tentatively, a way that we can see the context dependence needed to address paradoxes as not so extraordinary. Doing so will also allow us to connect thinking about the context dependence of quantifier domains with some interesting ideas about the distinctive semantic properties of certain quantifiers. (shrink)

The paradox that appears under Burali-Forti’s name in many textbooks of set theory is a clever piece of reasoning leading to an unproblematic theorem. The theorem asserts that the ordinals do not form a set. For such a set would be—absurdly—an ordinal greater than any ordinal in the set of all ordinals. In this article, we argue that the paradox of Burali-Forti is first and foremost a problem about concept formation by abstraction, not about sets. We contend, furthermore, that some (...) hundred years after its discovery the paradox is still without any fully satisfactory resolution. A survey of the current literature reveals one key assumption of the paradox that has gone unquestioned, namely the assumption that ordinals are objects. Taking the lead from Russell’s no class theory, we interpret talk of ordinals as an efficient way of conveying higher-order logical truths. The resulting theory of ordinals is formally adequate to standard intuitions about ordinals, expresses a conception of ordinal number capable of resolving Burali-Forti’s paradox, and offers a novel contribution to the longstanding program of reducing mathematics to higher-order logic. (shrink)

Semantic interpretations of both natural and formal languages are usually taken to involve the specification of a domain of entities with respect to which the sentences of the language are to be evaluated. A question that has received much attention of late is whether there is unrestricted quantification, quantification over a domain comprising absolutely everything there is. Is there a discourse or inquiry that has absolute generality? After framing the debate, this article provides an overview of the main arguments for (...) and against the possibility of unrestricted quantification, highlighting some of the broader implications of the debate. (shrink)

In light of the close connection between the ontological hierarchy of set theory and the ideological hierarchy of type theory, Øystein Linnebo and Agustín Rayo have recently offered an argument in favour of the view that the set-theoretic universe is open-ended. In this paper, we argue that, since the connection between the two hierarchies is indeed tight, any philosophical conclusions cut both ways. One should either hold that both the ontological hierarchy and the ideological hierarchy are open-ended, or that neither (...) is. If there is reason to accept the view that the set-theoretic universe is open-ended, that will be because such a view is the most compelling one to adopt on the purely ontological front. (shrink)

It is well known that Tarski proved a result which can be stated roughly as: no sufficiently rich, consistent, classical language can contain its own truth definition. Tarski's way around this problem is to deal with two languages at a time, an object language for which we are defining truth and a metalanguage in which the definition occurs. An obvious question then is: under what conditions can we construct a definition of truth for a given object language. Tarski claims that (...) it is necessary and sufficient that the metalanguage be "essentially richer". Our contention, put bluntly, is that this claim deserves more scrutiny from philosophers than it usually gets and in fact is false unless "essentially richer" means nothing else than "sufficient to contain a truth definition for the object language.". (shrink)

The view that plural reference is reference to a set is examined in light of George Boolos's treatment of second-order quantification as plural quantification in English. I argue that monadic second-order logic does not, in Boolos's treatment, reflect the behavior of plural quantifiers under negation and claim that any sentence that properly translates a second-order formula, in accordance with his treatment, has a first-order formulation. Support for this turns on the use of certain partitive constructions to assign values to variables (...) in a way that makes Boolos's reading of second-order variables available for a first-order language and, with it, the possibility of interpreting quantification in an unrestricted domain.A first-order theory, T(D), is developed on the basis of Boolos's treatment of simple plural definite descriptions extended to Richard Sharvy's general theory of definite plural and mass descriptions. I introduce a primitive predicate, o, for the relation of the referent of a singular description to that of its plural. If o is simply added to T(D), is definable in T(D), and the result is inconsistent. If o is added to a theory with axioms for the fragment of T(D) I call D-mereology, the result is a natural basis for the development of a pluralized Zermelo set theory. This theory, however, is inconsistent in an unrestricted domain, unless it is recast as a second-order theory of sets interpreted in Boolos's way. (shrink)

In this paper, I argue that the debate on Composition as Identity—the thesis that any composite object is identical to its parts—is deadlocked because both the defenders and the detractors of the claim have so far failed to take its philosophical core at face value and have, as a result, defended and criticized respectively something that is not Composition as Identity. After establishing how Composition as Identity should properly be understood and proposing for it a new interpretation centered around the (...) novel notion of metaphysical information, I set forth a strategy to defend it that crucially rests on the indefinite extensibility of the domain of quantification. I eventually suggest that “Composition as Analysis” is a name that better reflects the content and theoretical proposal of the thesis that Composition as Identity is supposed to be. (shrink)

Logic: the Basics is an accessible introduction to the core philosophy topic of standard logic. Focussing on traditional Classical Logic the book deals with topics such as mathematical preliminaries, propositional logic, monadic quantified logic, polyadic quantified logic, and English and standard ‘symbolic transitions’. With exercises and sample answers throughout this thoroughly revised new edition not only comprehensively covers the core topics at introductory level but also gives the reader an idea of how they can take their knowledge further and the (...) philosophical questions around logic. -/- Logic: the Basics is essential reading for first-year undergraduate philosophy students on standard introductory logic courses. (shrink)

This paper explores the relationship between Hume's Prinicple and Basic Law V, investigating the question whether we really do need to suppose that, already in Die Grundlagen, Frege intended that HP should be justified by its derivation from Law V.

ZFC has sentences that quantify over all sets or all ordinals, without restriction. Some have argued that sentences of this kind lack a determinate meaning. We propose a set theory called TOPS, using Natural Deduction, that avoids this problem by speaking only about particular sets.