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.

Bayesian epistemology has struggled with the problem of regularity: how to deal with events that in classical probability have zero probability. While the cases most discussed in the literature, such as infinite sequences of coin tosses or continuous spinners, do not actually come up in scientific practice, there are cases that do come up in science. I shall argue that these cases can be resolved without leaving the realm of classical probability, by choosing a probability measure that preserves “enough” regularity. (...) This approach also provides a resolution to the McGrew, McGrew and Vestrum normalization problem for the fine-tuning argument. (shrink)

We analyze the effect of replacing several natural uses of definability in set theory by the weaker model-theoretic notion of algebraicity. We find, for example, that the class of hereditarily ordinal algebraic sets is the same as the class of hereditarily ordinal definable sets; that is, $\mathrm{HOA}=\mathrm{HOD}$. Moreover, we show that every algebraic model of $\mathrm{ZF}$ is actually pointwise definable. Finally, we consider the implicitly constructible universe Imp—an algebraic analogue of the constructible universe—which is obtained by iteratively adding not only (...) the sets that are definable over what has been built so far, but also those that are algebraic over the existing structure. While we know that $\mathrm{Imp}$ can differ from $L$, the subtler properties of this new inner model are just now coming to light. Many questions remain open. (shrink)

Ehrenfeucht’s lemma asserts that whenever one element of a model of Peano arithmetic is definable from another, they satisfy different types. We consider here the analogue of Ehrenfeucht’s lemma for models of set theory. The original argument applies directly to the ordinal-definable elements of any model of set theory, and, in particular, Ehrenfeucht’s lemma holds fully for models of set theory satisfying V=HOD. We show that the lemma fails in the forcing extension of the universe by adding a Cohen real. (...) We go on to formulate a scheme of natural parametric generalizations of Ehrenfeucht’s lemma, namely, the principles of the form EL, which asserts that P-definability from A implies Q-discernibility. We also consider various analogues of Ehrenfeucht’s lemma obtained by using algebraicity in place of definability, where a set b is algebraic in a if it is a member of a finite set definable from a. Ehrenfeucht’s lemma holds for the ordinal-algebraic sets, we prove, if and only if the ordinal-algebraic and ordinal-definable sets coincide. Using a similar analysis, we answer two open questions posed earlier by the third author and C. Leahy, showing that algebraicity and definability need not coincide in models of set theory and the internal and external notions of being ordinal algebraic need not coincide. (shrink)

In a recent paper, John Wigglesworth explicates the notion of a set's being grounded in or ontologically depending on its members by the modal statement that in any world, that a set exists in that world entails that its members exist as well. After suggesting that variable-domain S5 captures an appropriate account of metaphysical necessity, Wigglesworth purports to prove that in any set theory satisfying the axiom Extensionality this condition holds, that is, that sets ontologically depend on their members with (...) respect to extraordinarily weak notions of set. This paper diagnoses a number of problems concerning Wigglesworth's formal argument. For one, we will show that Wigglesworth's argument is invalid as it requires an appeal to hidden, extralogical theses concerning rigid designation and the persistence of sets across possible worlds. Having demonstrated the indispensability of these principles to Wigglesworth's argument, we will then show that even granted the enthymematic premises, the argument only proves the ontological dependence of singletons on their members and does not extend to sets in general. Finally, we will consider strengthenings of Wigglesworth's reasoning and suggest that even the weakest generalization will bear undesirable consequences. (shrink)

The assertion that every definable set has a definable element is equivalent over to the principle, and indeed, we prove, so is the assertion merely that every Π2‐definable set has an ordinal‐definable element. Meanwhile, every model of has a forcing extension satisfying in which every Σ2‐definable set has an ordinal‐definable element. Similar results hold for and and other natural instances of.