Large Cardinals

The independence phenomenon in set theory, while pervasive, can be partially addressed through the use of large cardinal axioms. A commonly assumed idea is that large cardinal axioms are species of maximality principles. In this paper, I argue that whether or not large cardinal axioms count as maximality principles depends on prior commitments concerning the richness of the subset forming operation. In particular I argue that there is a conception of maximality through absoluteness, on which large cardinal axioms are restrictive. (...) I argue, however, that large cardinals are still important axioms of set theory and can play many of their usual foundational roles. (shrink)

Let's suppose you think that there are no uncountable sets. Have you adopted a restrictive position? It is certainly tempting to say yes---you've prohibited the existence of certain kinds of large set. This paper argues that this intuition can be challenged. Instead, I argue that there are some considerations based on a formal notion of restrictiveness which suggest that it is restrictive to hold that there are uncountable sets.

It is standard in set theory to assume that Cantor's Theorem establishes that the continuum is an uncountable set. A challenge for this position comes from the observation that through forcing one can collapse any cardinal to the countable and that the continuum can be made arbitrarily large. In this paper, we present a different take on the relationship between Cantor's Theorem and extensions of universes, arguing that they can be seen as showing that every set is countable and that (...) the continuum is a proper class. We examine several principles based on maximality considerations in this framework, and show how some (namely Ordinal Inner Model Hypotheses) enable us to incorporate standard set theories (including ZFC with large cardinals added). We conclude that the systems considered raise questions concerning the foundational purposes of set theory. (shrink)

This paper aims to contribute to the analysis of the nature of mathematical modality, and to the applications of the latter to unrestricted quantification and absolute decidability. Rather than countenancing the interpretational type of mathematical modality as a primitive, I argue that the interpretational type of mathematical modality is a species of epistemic modality. I argue, then, that the framework of two-dimensional semantics ought to be applied to the mathematical setting. The framework permits of a formally precise account of the (...) priority and relation between epistemic mathematical modality and metaphysical mathematical modality. The discrepancy between the modal systems governing the parameters in the two-dimensional intensional setting provides an explanation of the difference between the metaphysical possibility of absolute decidability and our knowledge thereof. I also advance a topic-sensitive epistemic two-dimensional truthmaker semantics, if hyperintensional approaches are to be preferred to possible worlds semantics. I examine the relation between two-dimensional hyperintensional states and epistemic set theory, providing two-dimensional hyperintensional formalizations of the modal logic of ZFC, large cardinal axioms, $\Omega$-logic, and the Epistemic Church-Turing Thesis. (shrink)

We prove two general results about the preservation of extendible and $C^{(n)}$ -extendible cardinals under a wide class of forcing iterations (Theorems 5.4 and 7.5). As applications we give new proofs of the preservation of Vopěnka’s Principle and $C^{(n)}$ -extendible cardinals under Jensen’s iteration for forcing the GCH [17], previously obtained in [8, 27], respectively. We prove that $C^{(n)}$ -extendible cardinals are preserved by forcing with standard Easton-support iterations for any possible $\Delta _2$ -definable behaviour of the power-set function on (...) regular cardinals. We show that one can force proper class-many disagreements between the universe and HOD with respect to the calculation of successors of regular cardinals, while preserving $C^{(n)}$ -extendible cardinals. We also show, assuming the GCH, that the class forcing iteration of Cummings–Foreman–Magidor for forcing $\diamondsuit _{\kappa ^+}^+$ at every $\kappa $ [10] preserves $C^{(n)}$ -extendible cardinals. We give an optimal result on the consistency of weak square principles and $C^{(n)}$ -extendible cardinals. In the last section prove another preservation result for $C^{(n)}$ -extendible cardinals under very general (not necessarily definable or weakly homogeneous) class forcing iterations. As applications we prove the consistency of $C^{(n)}$ -extendible cardinals with $\mathrm {{V}}=\mathrm {{HOD}}$, and also with $\mathrm {GA}$ (the Ground Axiom) plus $\mathrm {V}\neq \mathrm {HOD}$, the latter being a strengthening of a result from [14]. (shrink)

A question dating to Mardešić and Prasolov’s 1988 work [S. Mardešić and A. V. Prasolov, Strong homology is not additive, Trans. Amer. Math. Soc. 307(2) (1988) 725–744], and motivating a considerable amount of set theoretic work in the years since, is that of whether it is consistent with the ZFC axioms for the higher derived limits [Formula: see text] [Formula: see text] of a certain inverse system [Formula: see text] indexed by [Formula: see text] to simultaneously vanish. An equivalent formulation (...) of this question is that of whether it is consistent for all [Formula: see text]-coherent families of functions indexed by [Formula: see text] to be trivial. In this paper, we prove that, in any forcing extension given by adjoining [Formula: see text]-many Cohen reals, [Formula: see text] vanishes for all [Formula: see text]. Our proof involves a detailed combinatorial analysis of the forcing extension and repeated applications of higher-dimensional [Formula: see text]-system lemmas. This work removes all large cardinal hypotheses from the main result of [J. Bergfalk and C. Lambie-Hanson, Simultaneously vanishing higher derived limits, Forum Math. Pi 9 (2021) e4] and substantially reduces the least value of the continuum known to be compatible with the simultaneous vanishing of [Formula: see text] for all [Formula: see text]. (shrink)

We define a potentialist system of ZF $\mathsf {ZF}$ -structures, i.e., a collection of possible worlds in the language of ZF $\mathsf {ZF}$ connected by a binary accessibility relation, achieving a potentialist account of the full background set-theoretic universe V. The definition involves Berkeley cardinals, the strongest known large cardinal axioms, inconsistent with the Axiom of Choice. In fact, as background theory we assume just ZF $\mathsf {ZF}$. It turns out that the propositional modal assertions which are valid at every (...) world of our system are exactly those in the modal theory S 4. 2 $\mathsf {S4.2}$. Moreover, we characterize the worlds satisfying the potentialist maximality principle, and thus the modal theory S 5 $\mathsf {S5}$, both for assertions in the language of ZF $\mathsf {ZF}$ and for assertions in the full potentialist language. (shrink)

There is no prospect of discovering measurable cardinals by radio astronomy, but this does not mean that higher set theory is entirely irrelevant to applied mathematics broadly construed. By way of example, the bearing of some celebrated descriptive-set-theoretic consequences of large cardinals on measurable-selection theory, a body of results originating with a key lemma in von Neumann’s work on the mathematical foundations of quantum theory, and further developed in connection with problems of mathematical economics, will be considered from a philosophical (...) point of view. (shrink)

El estudio de los "cardinales grandes" es uno de los principales temas de investigación de la teoría de conjuntos y de la teoría de modelos que ha contribuido con el desarrollo de dichas disciplinas. Existe una gran variedad de tales cardinales, por ejemplo cardinales inaccesibles, débilmente compactos, Ramsey, medibles, supercompactos, etc. Tres valiosos teoremas clásicos sobre cardinales medibles son los siguientes: (i) compacidad débil, (ii) Si κ es un cardinal medible, entonces κ es un cardinal inaccesible y existen κ cardinales (...) inaccesibles menores que κ , y (iii) Si existe un cardinal medible, entonces el axioma de constructibilidad (V=L) es falso. El objetivo de este artículo es presentar una demostración de cada uno de estos tres teoremas en el contexto de la teoría de modelos usando ideas del texto de Chang y Keisler (Model Theory). Tales demostraciones tienen en común el uso del método de construcción de modelos llamado ultraproductos, de lógicas infinitarias o fragmentos de la lógica de segundo orden, y del axioma de elección. Cardinales grandes y/o ultraproductos son importantes en teoría de conjuntos, teoría de modelos, análisis matemático, teoría de la medida, probabilidades, topología, análisis funcional, física, teoría de números, finanzas, etc. (shrink)

The dissertation under comment is a contribution to the area of Set Theory concerned with the interactions between the method of Forcing and the so-called Large Cardinal axioms.The dissertation is divided into two thematic blocks. In Block I we analyze the large-cardinal hierarchy between the first supercompact cardinal and Vopěnka’s Principle. In turn, Block II is devoted to the investigation of some problems arising from Singular Cardinal Combinatorics.We commence Part I by investigating the Identity Crisis phenomenon in the region comprised (...) between the first supercompact cardinal and Vopěnka’s Principle. As a result, we generalize Magidor’s classical theorems [2] to this higher region of the large-cardinal hierarchy. Also, our analysis allows to settle all the questions that were left open in [1]. Finally, we conclude Part I by presenting a general theory of preservation of $C^{}$ -extendible cardinals under class forcing iterations. From this analysis we derive several applications. For instance, our arguments are used to show that an extendible cardinal is consistent with “ $^{\mathrm {HOD}}<\lambda ^+$, for every regular cardinal $\lambda $.” In particular, if Woodin’s HOD Conjecture holds, and therefore it is provable in ZFC + “There exists an extendible cardinal” that above the first extendible cardinal every singular cardinal $\lambda $ is singular in HOD and $^{\textrm {{HOD}}}=\lambda ^+$, there may still be no agreement at all between V and HOD about successors of regular cardinals.In Part II and Part III we analyse the relationship between the Singular Cardinal Hypothesis with other relevant combinatorial principles at the level of successors of singular cardinals. Two of these are the Tree Property and the Reflection of Stationary sets, which are central in Infinite Combinatorics.Specifically, Part II is devoted to prove the consistency of the Tree Property at both $\kappa ^+$ and $\kappa ^{++}$, whenever $\kappa $ is a strong limit singular cardinal witnessing an arbitrary failure of the SCH. This generalizes the main result of [3] in two senses: it allows arbitrary cofinalities for $\kappa $ and arbitrary failures for the SCH.In the last part of the dissertation we introduce the notion of $\Sigma $ -Prikry forcing. This new concept allows an abstract and uniform approach to the theory of Prikry-type forcings and encompasses several classical examples of Prikry-type forcing notions, such as the classical Prikry forcing, the Gitik-Sharon poset, or the Extender Based Prikry forcing, among many others.Our motivation in this part of the dissertation is to prove an iteration theorem at the level of the successor of a singular cardinal. Specifically, we aim for a theorem asserting that every $\kappa ^{++}$ -length iteration with support of size $\leq \kappa $ has the $\kappa ^{++}$ -cc, provided the iterates belong to a relevant class of $\kappa ^{++}$ -cc forcings. While there are a myriad of works on this vein for regular cardinals, this contrasts with the dearth of investigations in the parallel context of singular cardinals. Our main contribution is the proof that such a result is available whenever the class of forcings under consideration is the family of $\Sigma $ -Prikry forcings. Finally, and as an application, we prove that it is consistent—modulo large cardinals—the existence of a strong limit cardinal $\kappa $ with countable cofinality such that $\mathrm {SCH}_\kappa $ fails and every finite family of stationary subsets of $\kappa ^+$ reflects simultaneously. (shrink)

In set theory, a maximality principle is a principle that asserts some maximality property of the universe of sets or some part thereof. Set theorists have formulated a variety of maximality principles in order to settle statements left undecided by current standard set theory. In addition, philosophers of mathematics have explored maximality principles whilst attempting to prove categoricity theorems for set theory or providing criteria for selecting foundational theories. This article reviews recent work concerned with the formulation, investigation and justification (...) of maximality principles. (shrink)

This article introduces a new reflection principle. It is based on the idea that whatever is true in all entities of some kind is also true in a set-sized collection of them. Unlike standard reflection principles, it does not re-interpret parameters or predicates. This allows it to be both consistent in all higher-order languages and remarkably strong. For example, I show that in the language of second-order set theory with predicates for a satisfaction relation, it is consistent relative to the (...) existence of a 2-extendible cardinal (Theorem 7.12) and implies the existence of a proper class of 1-extendible cardinals (Theorem 7.9). (shrink)

Reflection Principles are commonly thought to produce only strong axioms of infinity consistent with V = L. It would be desirable to have some notion of strong reflection to remedy this, and we have proposed Global Reflection Principles based on a somewhat Cantorian view of the universe. Such principles justify the kind of cardinals needed for, inter alia , Woodin’s Ω-Logic.

A pervasive thought in contemporary philosophy of mathematics is that in order to justify reflection principles, one must hold universism: the view that there is a single universe of pure sets. I challenge this kind of reasoning by contrasting universism with a Zermelian form of multiversism. I argue that if extant justifications of reflection principles using notions of richness are acceptable for the universist, then the Zermelian can use similar justifications. However, I note that for some forms of richness argument, (...) the status of reflection principles as axioms is left open for the Zermelian. (shrink)

In connection with his interest in selfdistributive algebra, Richard Laver established two deep results with potential applications in low-dimen\-sional topology, namely the existence of what is now known as the Laver tables and the well-foundedness of the standard ordering of positive braids. Here we present these results and discuss the way they could be used in topological applications.

Maddy gave a semi-formal account of restrictiveness by defining a formal notion based on a class of interpretations and explaining how to handle false positives and false negatives. Recently, Hamkins pointed out some structural issues with Maddy's definition. We look at Maddy's formal definitions from the point of view of an abstract interpretation relation. We consider various candidates for this interpretation relation, including one that is close to Maddy's original notion, but fixes the issues raised by Hamkins. Our work brings (...) to light additional structural issues that we also discuss. (shrink)

The dream solution of the continuum hypothesis would be a solution by which we settle the continuum hypothesis on the basis of a newly discovered fundamental principle of set theory, a missing axiom, widely regarded as true. Such a dream solution would indeed be a solution, since we would all accept the new axiom along with its consequences. In this article, however, I argue that such a dream solution to $\mathrm {CH}$ is unattainable.

The interaction between large cardinals, determinacy of two-person perfect information games, and inner model theory has been a singularly powerful driving force in modern set theory during the last three decades. For the outsider the intellectual excitement is often tempered by the somewhat daunting technicalities, and the seeming length of study needed to understand the flow of ideas. The purpose of this article is to try and give a short, albeit rather rough, guide to the broad lines of development.

Are there any things that are such that any things whatsoever are among them. I argue that there are not. My thesis follows from these three premises: (1) There are two or more things; (2) for any things, there is a unique thing that corresponds to those things; (3) for any two or more things, there are fewer of them than there are pluralities of them.

The paper begins with an examination of Gödel's views on absolute undecidability and related topics in set theory. These views are sharpened and assessed in light of recent developments. It is argued that a convincing case can be made for axioms that settle many of the questions undecided by the standard axioms and that in a precise sense the program for large cardinals is a complete success “below” CH. It is also argued that there are reasonable scenarios for settling CH (...) and that there is not currently a convincing case to the effect that a given statement is absolutely undecidable. (shrink)

We use a reverse Easton forcing iteration to obtain a universe with a definable well-order, while preserving the GCH and proper classes of a variety of very large cardinals. This is achieved by coding using the principle ◊ $_{k^ - }^* $ at a proper class of cardinals k. By choosing the cardinals at which coding occurs sufficiently sparsely, we are able to lift the embeddings witnessing the large cardinal properties without having to meet any non-trivial master conditions.

The motivation for this paper is the following: In [4] I showed that it is inconsistent with ZFC that the Maximality Principle for directed closed forcings holds at unboundedly many regular cardinals κ (even only allowing κ itself as a parameter in the Maximality Principle for < κ -closed forcings each time). So the question is whether it is consistent to have this principle at unboundedly many regular cardinals or at every regular cardinal below some large cardinal κ (instead of (...) ∞), and if so. how strong it is. It turns out that it is consistent in many cases, but the consistency strength is quite high. (shrink)

We show that either of the following hypotheses imply that there is an inner model with a proper class of strong cardinals and a proper class of Woodin cardinals. 1) There is a countably closed cardinal k ≥ N₃ such that □k and □(k) fail. 2) There is a cardinal k such that k is weakly compact in the generic extension by Col(k, k⁺). Of special interest is 1) with k = N₃ since it follows from PFA by theorems of (...) Todorcevic and Velickovic. Our main new technical result, which is due to the first author, is a weak covering theorem for the model obtained by stacking mice over $K^c ||k.$. (shrink)

In a recent article, Christopher Ormell argues against the traditional mathematical view that the real numbers form an uncountably infinite set. He rejects the conclusion of Cantor’s diagonal argument for the higher, non-denumerable infinity of the real numbers. He does so on the basis that the classical conception of a real number is mys- terious, ineffable, and epistemically suspect. Instead, he urges that mathematics should admit only ‘well-defined’ real numbers as proper objects of study. In practice, this means excluding as (...) inadmissible all those real numbers whose decimal expansions cannot be calculated in as much detail as one would like by some rule. We argue against Ormell that the classical realist account of the continuum has explanatory power in mathematics and should be accepted, much in the same way that "dark matter" is posited by physicists to explain observations in cosmology. In effect, the indefinable real numbers are like the "dark matter" of real analysis. (shrink)

We prove that a combinatorial consequence of the negation of the PCF conjecture for intervals, involving free subsets relative to set mappings, is not implied by even the strongest known large cardinal axiom.

We produce counterexamples to the unique and cofinal branches hypotheses, assuming (slightly less than) the existence of a cardinal which is strong past a Woodin cardinal.

This book is an exploration of philosophical questions about infinity. Graham Oppy examines how the infinite lurks everywhere, both in science and in our ordinary thoughts about the world. He also analyses the many puzzles and paradoxes that follow in the train of the infinite. Even simple notions, such as counting, adding and maximising present serious difficulties. Other topics examined include the nature of space and time, infinities in physical science, infinities in theories of probability and decision, the nature of (...) part/whole relations, mathematical theories of the infinite, and infinite regression and principles of sufficient reason. (shrink)

In this paper I present two new arguments against the possibility of an omniscient being. My new arguments invoke considerations of cardinality and resemble several arguments originally presented by Patrick Grim. Like Grim, I give reasons to believe that there must be more objects in the universe than there are beliefs. However, my arguments will rely on certain mereological claims, namely that Classical Extensional Mereology is necessarily true of the part-whole relation. My first argument is an instance of a problem (...) first noted by Gideon Rosen and requires an additional assumption about the mereological structure of certain beliefs. That assumption is that an omniscient being’s beliefs are mereological simples. However, this assumption is dropped when I present my second argument. Thus, I hope to show that if Classical Extensional Mereology is true of the part-whole relation, there cannot be an omniscient being. (shrink)

We construct, assuming that there is no inner model with a Woodin cardinal but without any large cardinal assumption, a model Kc which is iterable for set length iterations, which is universal with respect to all weasels with which it can be compared, and is universal with respect to set sized premice.

We summarize the known methods of producing a non-supercompact strongly compact cardinal and describe some new variants. Our Main Theorem shows how to apply these methods to many cardinals simultaneously and exactly control which cardinals are supercompact and which are only strongly compact in a forcing extension. Depending upon the method, the surviving non-supercompact strongly compact cardinals can be strong cardinals, have trivial Mitchell rank or even contain a club disjoint from the set of measurable cardinals. These results improve and (...) unify Theorems 1 and 2 of [5], due to the first author. (shrink)

Can a supercompact cardinal κ be Laver indestructible when there is a level-by-level agreement between strong compactness and supercompactness? In this article, we show that if there is a sufficiently large cardinal above κ, then no, it cannot. Conversely, if one weakens the requirement either by demanding less indestructibility, such as requiring only indestructibility by stratified posets, or less level-by-level agreement, such as requiring it only on measure one sets, then yes, it can.

The paper investigates inaccessible set axioms and their consistency strength in constructive set theory. In ZFC inaccessible sets are of the form Vκ where κ is a strongly inaccessible cardinal and Vκ denotes the κth level of the von Neumann hierarchy. Inaccessible sets figure prominently in category theory as Grothendieck universes and are related to universes in type theory. The objective of this paper is to show that the consistency strength of inaccessible set axioms heavily depend on the context in (...) which they are embedded. The context here will be the theory CZF− of constructive Zermelo–Fraenkel set theory but without -Induction . Let INAC be the statement that for every set there is an inaccessible set containing it. CZF−+INAC is a mathematically rich theory in which one can easily formalize Bishop style constructive mathematics and a great deal of category theory. CZF−+INAC also has a realizability interpretation in type theory which gives its theorems a direct computational meaning. The main result presented here is that the proof theoretic ordinal of CZF−+INAC is a small ordinal known as the Feferman–Schütte ordinal Γ0. (shrink)

We show how the forcing of [5] can be iterated so as to get a model containing supercompact cardinals in which every measurable cardinal δ is δ + supercompact. We then apply this iteration to prove three additional theorems concerning the structure of the class of supercompact cardinals.

In this paper, two theorems concerning measurable limits of strong cardinals and supercompactness are proven. This generalizes earlier work, both individual and joint with Shelah.

Using work of Devlin and Schindler in conjunction with work on Prikry forcing in a choiceless context done by the author, we show that two choiceless cardinal patterns have consistency strength of at least one Woodin cardinal.

We extend earlier work (both individual and joint with Shelah) and prove three theorems about the class of measurable limits of compact cardinals, where a compact cardinal is one which is either strongly compact or supercompact. In particular, we construct two models in which every measurable limit of compact cardinals below the least supercompact limit of supercompact cardinals possesses non-trivial degrees of supercompactness. In one of these models, every measurable limit of compact cardinals is a limit of supercompact cardinals and (...) also a limit of strongly compact cardinals having no non-trivial degree of supercompactness. We also show that it is consistent for the least supercompact cardinal κ to be a limit of strongly compact cardinals and be so that every measurable limit of compact cardinals below κ has a non-trivial degree of supercompactness. In this model, the only compact cardinals below κ with a non-trivial degree of supercompactness are the measurable limits of compact cardinals. (shrink)

Part of the ambiguity lies in the various points of view from which this question might be considered. The crudest di erence lies between the point of view of the working mathematician and that of the logician concerned with the foundations of mathematics. Now some of my fellow mathematical logicians might protest this distinction, since they consider themselves to be just more of those \working mathematicians". Certainly, modern logic has established itself as a very respectable branch of mathematics, and there (...) are quite a few highly technical journals in logic, such as The Journal of Sym-. (shrink)

Using an idea developed in joint work with Shelah, we show how to redefine Laver's notion of forcing making a supercompact cardinal $\kappa$ indestructible under $\kappa$-directed closed forcing to give a new proof of the Kimchi-Magidor Theorem in which every compact cardinal in the universe satisfies certain indestructibility properties. Specifically, we show that if K is the class of supercompact cardinals in the ground model, then it is possible to force and construct a generic extension in which the only strongly (...) compact cardinals are the elements of K or their measurable limit points, every $\kappa \in K$ is a supercompact cardinal indestructible under $\kappa$-directed closed forcing, and every $\kappa$ a measurable limit point of K is a strongly compact cardinal indestructible under $\kappa$-directed closed forcing not changing $\wp$. We then derive as a corollary a model for the existence of a strongly compact cardinal $\kappa$ which is not $\kappa^+$ supercompact but which is indestructible under $\kappa$-directed closed forcing not changing $\wp and remains non-$\kappa^+$ supercompact after such a forcing has been done. (shrink)

We show the consistency, relative to a supercompact cardinal, of the least measurable cardinal being both strongly compact and fully Laver indestructible. We also show the consistency, relative to a supercompact cardinal, of the least strongly compact cardinal being somewhat supercompact yet not completely supercompact and having both its strong compactness and degree of supercompactness fully Laver indestructible.

Applying Woodin's non-stationary tower notion of forcing, I prove that the existence of a supercompact cardinal κ in V and a Ramsey dilator in some small forcing extension V[G] implies the existence in V of a measurable dilator of size κ, measurable by κ-complete measures.

In this paper, we sketch the development of two important themes of modern set theory, both of which can be regarded as growing out of work of Kurt Gödel. We begin with a review of some basic concepts and conventions of set theory.§0. The ordinal numbers were Georg Cantor's deepest contribution to mathematics. After the natural numbers 0, 1, …, n, … comes the first infinite ordinal number ω, followed by ω + 1, ω + 2, …, ω + ω, (...) … and so forth. ω is the first limit ordinal as it is neither 0 nor a successor ordinal. We follow the von Neumann convention, according to which each ordinal number α is identified with the set {ν ∣ ν α} of its predecessors. The ∈ relation on ordinals thus coincides with <. We have 0 = ∅ and α + 1 = α ∪ {α}. According to the usual set-theoretic conventions, ω is identified with the first infinite cardinal ℵ0, similarly for the first uncountable ordinal number ω1 and the first uncountable cardinal number ℵ1, etc. We thus arrive at the following picture:The von Neumann hierarchy divides the class V of all sets into a hierarchy of sets Vα indexed by the ordinal numbers. The recursive definition reads: ;Vλ = ∪v<λVv for limit ordinals λ. We can represent this hierarchy by the following picture. (shrink)