## Upward closure and amalgamation in the generic multiverse of a countable model of set theory

- J. D. Hamkins, “Upward closure and amalgamation in the generic multiverse of a countable model of set theory.” (manuscript under review, Newton Institute preprint ni15066)
`@ARTICLE{Hamkins:UpwardClosureAndAmalgamationInTheGenericMultiverse, author = {Joel David Hamkins}, title = {Upward closure and amalgamation in the generic multiverse of a countable model of set theory}, journal = {}, year = {}, volume = {}, number = {}, pages = {}, month = {}, note = {manuscript under review, Newton Institute preprint ni15066}, url = {http://jdh.hamkins.org/upward-closure-and-amalgamation-in-the-generic-multiverse}, eprint = {1511.01074}, abstract = {}, keywords = {}, source = {}, }`

**Abstract.**I prove several theorems concerning upward closure and amalgamation in the generic multiverse of a countable transitive model of set theory. Every such model $W$ has forcing extensions $W[c]$ and $W[d]$ by adding a Cohen real, which cannot be amalgamated in any further extension, but some nontrivial forcing notions have all their extensions amalgamable. An increasing chain $W[G_0]\subseteq W[G_1]\subseteq\cdots$ has an upper bound $W[H]$ if and only if the forcing had uniformly bounded essential size in $W$. Every chain $W\subseteq W[c_0]\subseteq W[c_1]\subseteq \cdots$ of extensions adding Cohen reals is bounded above by $W[d]$ for some $W$-generic Cohen real $d$.This article is based upon I talk I gave at the conference on Recent Developments in Axiomatic Set Theory at the Research Institute for Mathematical Sciences (RIMS) at Kyoto University, Japan in September, 2015, and I am extremely grateful to my Japanese hosts, especially Toshimichi Usuba, for supporting my research visit there and also at the CTFM conference at Tokyo Institute of Technology just preceding it. This article includes material adapted from section section 2 of Set-theoretic geology, joint with G. Fuchs, myself and J. Reitz, and also includes a theorem that was proved in a series of conversations I had with Giorgio Venturi at the Young Set Theory Workshop 2011 in Bonn and continuing at the London 2011 summer school on set theory at Birkbeck University London.

- My talk at RIMS: Upward closure in the generic multiverse of a countable model of set theory
- My talk at CTFM: Universality and embeddability amongst the models of set theory
- G. Fuchs, J. D. Hamkins, J. Reitz, Set-theoretic geology, Annals of Pure and Applied Logic, vol. 166, iss. 4, pp. 464-501, 2015.
- Upward closure in the toy multiverse of all countable models of set theory
- Upward countable closure in the generic multiverse of forcing to add a Cohen real

- J. D. Hamkins, “Upward closure and amalgamation in the generic multiverse of a countable model of set theory.” (manuscript under review, Newton Institute preprint ni15066)
## Satisfaction is not absolute

- J. D. Hamkins and R. Yang, “Satisfaction is not absolute,” to appear in the Review of Symbolic Logic, pp. 1-34.
`@ARTICLE{HamkinsYang:SatisfactionIsNotAbsolute, author = {Joel David Hamkins and Ruizhi Yang}, title = {Satisfaction is not absolute}, journal = {to appear in the Review of Symbolic Logic}, year = {}, volume = {}, number = {}, pages = {1--34}, month = {}, note = {}, abstract = {}, keywords = {}, source = {}, eprint = {1312.0670}, url = {http://jdh.hamkins.org/satisfaction-is-not-absolute}, doi = {}, }`

$\newcommand\N{\mathbb{N}}\newcommand\satisfies{\models}$

**Abstract.***We prove that the satisfaction relation $\mathcal{N}\satisfies\varphi[\vec a]$ of first-order logic is not absolute between models of set theory having the structure $\mathcal{N}$ and the formulas $\varphi$ all in common.**Two models of set theory can have the same natural numbers, for example, and the same standard model of arithmetic $\langle\N,{+},{\cdot},0,1,{\lt}\rangle$, yet disagree on their theories of arithmetic truth; two models of set theory can have the same natural numbers and the same arithmetic truths, yet disagree on their truths-about-truth, at any desired level of the iterated truth-predicate hierarchy; two models of set theory can have the same natural numbers and the same reals, yet disagree on projective truth; two models of set theory can have the same $\langle H_{\omega_2},{\in}\rangle$ or the same rank-initial segment $\langle V_\delta,{\in}\rangle$, yet disagree on which assertions are true in these structures.**On the basis of these mathematical results, we argue that a philosophical commitment to the determinateness of the theory of truth for a structure cannot be seen as a consequence solely of the determinateness of the structure in which that truth resides. The determinate nature of arithmetic truth, for example, is not a consequence of the determinate nature of the arithmetic structure $\N=\{ 0,1,2,\ldots\}$ itself, but rather, we argue, is an additional higher-order commitment requiring its own analysis and justification.*Many mathematicians and philosophers regard the natural numbers $0,1,2,\ldots\,$, along with their usual arithmetic structure, as having a privileged mathematical existence, a Platonic realm in which assertions have definite, absolute truth values, independently of our ability to prove or discover them. Although there are some arithmetic assertions that we can neither prove nor refute—such as the consistency of the background theory in which we undertake our proofs—the view is that nevertheless there is a fact of the matter about whether any such arithmetic statement is true or false in the intended interpretation. The definite nature of arithmetic truth is often seen as a consequence of the definiteness of the structure of arithmetic $\langle\N,{+},{\cdot},0,1,{\lt}\rangle$ itself, for if the natural numbers exist in a clear and distinct totality in a way that is unambiguous and absolute, then (on this view) the first-order theory of truth residing in that structure—arithmetic truth—is similarly clear and distinct.

Feferman provides an instance of this perspective when he writes (Feferman 2013, Comments for EFI Workshop, p. 6-7) :

*In my view, the conception [of the bare structure of the natural numbers] is*completely clear*, and thence*all arithmetical statements are definite*.*It is Feferman’s `thence’ to which we call attention. Martin makes a similar point (Martin, 2012, Completeness or incompleteness of basic mathematical concepts):

What I am suggesting is that the real reason for confidence in first-order completeness is our confidence in the full determinateness of the concept of the natural numbers.

Many mathematicians and philosophers seem to share this perspective. The truth of an arithmetic statement, to be sure, does seem to depend entirely on the structure $\langle\N,{+},{\cdot},0,1,{\lt}\rangle$, with all quantifiers restricted to $\N$ and using only those arithmetic operations and relations, and so if that structure has a definite nature, then it would seem that the truth of the statement should be similarly definite.

Nevertheless, in this article we should like to tease apart these two ontological commitments, arguing that the definiteness of truth for a given mathematical structure, such as the natural numbers, the reals or higher-order structures such as $H_{\omega_2}$ or $V_\delta$, does not follow from the definite nature of the underlying structure in which that truth resides. Rather, we argue that the commitment to a theory of truth for a structure is a higher-order ontological commitment, going strictly beyond the commitment to a definite nature for the underlying structure itself.

We make our argument in part by proving that different models of set theory can have a structure identically in common, even the natural numbers, yet disagree on the theory of truth for that structure.

**Theorem.**- Two models of set theory can have the same structure of arithmetic $$\langle\N,{+},{\cdot},0,1,{\lt}\rangle^{M_1}=\langle\N,{+},{\cdot},0,1,{\lt}\rangle^{M_2},$$yet disagree on the theory of arithmetic truth.
- Two models of set theory can have the same natural numbers and a computable linear order in common, yet disagree about whether it is a well-order.
- Two models of set theory that have the same natural numbers and the same reals, yet disagree on projective truth.
- Two models of set theory can have a transitive rank initial segment in common $$\langle V_\delta,{\in}\rangle^{M_1}=\langle V_\delta,{\in}\rangle^{M_2},$$yet disagree about whether it is a model of ZFC.

The proofs use only elementary classical methods, and might be considered to be a part of the folklore of the subject of models of arithmetic. The paper includes many further examples of the phenomenon, and concludes with a philosophical discussion of the issue of definiteness, concerning the question of whether one may deduce definiteness-of-truth from definiteness-of-objects and definiteness-of-structure.

- J. D. Hamkins and R. Yang, “Satisfaction is not absolute,” to appear in the Review of Symbolic Logic, pp. 1-34.
## Superstrong and other large cardinals are never Laver indestructible

- J. Bagaria, J. D. Hamkins, K. Tsaprounis, and T. Usuba, “Superstrong and other large cardinals are never Laver indestructible,” to appear in Archive for Mathematical Logic (special issue in honor of Richard Laver).
`@ARTICLE{BagariaHamkinsTsaprounisUsuba:SuperstrongAndOtherLargeCardinalsAreNeverLaverIndestructible, author = {Joan Bagaria and Joel David Hamkins and Konstantinos Tsaprounis and Toshimichi Usuba}, title = {Superstrong and other large cardinals are never {Laver} indestructible}, journal = {to appear in Archive for Mathematical Logic (special issue in honor of Richard Laver)}, year = {}, volume = {}, number = {}, pages = {}, month = {}, note = {}, abstract = {}, keywords = {}, eprint = {1307.3486}, url = {http://jdh.hamkins.org/superstrong-never-indestructible/}, comment = {http://jdh.hamkins.org/superstrong-never-indestructible/}, source = {}, }`

**Abstract.**Superstrong cardinals are never Laver indestructible. Similarly, almost huge cardinals, huge cardinals, superhuge cardinals, rank-into-rank cardinals, extendible cardinals, $1$-extendible cardinals, $0$-extendible cardinals, weakly superstrong cardinals, uplifting cardinals, pseudo-uplifting cardinals, superstrongly unfoldable cardinals, $\Sigma_n$-reflecting cardinals, $\Sigma_n$-correct cardinals and $\Sigma_n$-extendible cardinals (all for $n\geq 3$) are never Laver indestructible. In fact, all these large cardinal properties are superdestructible: if $\kappa$ exhibits any of them, with corresponding target $\theta$, then in any forcing extension arising from nontrivial strategically ${\lt}\kappa$-closed forcing $\mathbb{Q}\in V_\theta$, the cardinal $\kappa$ will exhibit none of the large cardinal properties with target $\theta$ or larger.The large cardinal indestructibility phenomenon, occurring when certain preparatory forcing makes a given large cardinal become necessarily preserved by any subsequent forcing from a large class of forcing notions, is pervasive in the large cardinal hierarchy. The phenomenon arose in Laver’s seminal result that any supercompact cardinal $\kappa$ can be made indestructible by ${\lt}\kappa$-directed closed forcing. It continued with the Gitik-Shelah treatment of strong cardinals; the universal indestructibility of Apter and myself, which produced simultaneous indestructibility for all weakly compact, measurable, strongly compact, supercompact cardinals and others; the lottery preparation, which applies generally to diverse large cardinals; work of Apter, Gitik and Sargsyan on indestructibility and the large-cardinal identity crises; the indestructibility of strongly unfoldable cardinals; the indestructibility of Vopenka’s principle; and diverse other treatments of large cardinal indestructibility. Based on these results, one might be tempted to the general conclusion that all the usual large cardinals can be made indestructible.

In this article, my co-authors and I temper that temptation by proving that certain kinds of large cardinals cannot be made nontrivially indestructible. Superstrong cardinals, we prove, are never Laver indestructible. Consequently, neither are almost huge cardinals, huge cardinals, superhuge cardinals, rank-into-rank cardinals, extendible cardinals and $1$-extendible cardinals, to name a few. Even the $0$-extendible cardinals are never indestructible, and neither are weakly superstrong cardinals, uplifting cardinals, pseudo-uplifting cardinals, strongly uplifting cardinals, superstrongly unfoldable cardinals, $\Sigma_n$-reflecting cardinals, $\Sigma_n$-correct cardinals and $\Sigma_n$-extendible cardinals, when $n\geq 3$. In fact, all these large cardinal properties are superdestructible, in the sense that if $\kappa$ exhibits any of them, with corresponding target $\theta$, then in any forcing extension arising from nontrivial strategically ${\lt}\kappa$-closed forcing $\mathbb{Q}\in V_\theta$, the cardinal $\kappa$ will exhibit none of the large cardinal properties with target $\theta$ or larger. Many quite ordinary forcing notions, which one might otherwise have expected to fall under the scope of an indestructibility result, will definitely ruin all these large cardinal properties. For example, adding a Cohen subset to any cardinal $\kappa$ will definitely prevent it from being superstrong—as well as preventing it from being uplifting, $\Sigma_3$-correct, $\Sigma_3$-extendible and so on with all the large cardinal properties mentioned above—in the forcing extension.

**Main Theorem.**- Superstrong cardinals are never Laver indestructible.
- Consequently, almost huge, huge, superhuge and rank-into-rank cardinals are never Laver indestructible.
- Similarly, extendible cardinals, $1$-extendible and even $0$-extendible cardinals are never Laver indestructible.
- Uplifting cardinals, pseudo-uplifting cardinals, weakly superstrong cardinals, superstrongly unfoldable cardinals and strongly uplifting cardinals are never Laver indestructible.
- $\Sigma_n$-reflecting and indeed $\Sigma_n$-correct cardinals, for each finite $n\geq 3$, are never Laver indestructible.
- Indeed—the strongest result here, because it is the weakest notion—$\Sigma_3$-extendible cardinals are never Laver indestructible.

In fact, each of these large cardinal properties is superdestructible. Namely, if $\kappa$ exhibits any of them, with corresponding target $\theta$, then in any forcing extension arising from nontrivial strategically ${\lt}\kappa$-closed forcing $\mathbb{Q}\in V_\theta$, the cardinal $\kappa$ will exhibit none of the mentioned large cardinal properties with target $\theta$ or larger.

The proof makes use of a detailed analysis of the complexity of the definition of the ground model in the forcing extension. These results are, to my knowledge, the first applications of the ideas of set-theoretic geology not making direct references to set-theoretically geological concerns.

Theorem 10 in the article answers (the main case of) a question I had posed on MathOverflow, namely, Can a model of set theory be realized as a Cohen-subset forcing extension in two different ways, with different grounds and different cardinals? I had been specifically interested there to know whether a cardinal $\kappa$ necessarily becomes definable after adding a Cohen subset to it, and theorem 10 shows indeed that it does: after adding a Cohen subset to a cardinal, it becomes $\Sigma_3$-definable in the extension, and this fact can be seen as explaining the main theorem above.

- J. Bagaria, J. D. Hamkins, K. Tsaprounis, and T. Usuba, “Superstrong and other large cardinals are never Laver indestructible,” to appear in Archive for Mathematical Logic (special issue in honor of Richard Laver).
## A multiverse perspective on the axiom of constructiblity

- J. D. Hamkins, “A multiverse perspective on the axiom of constructibility,” in Infinity and truth, World Sci. Publ., Hackensack, NJ, 2014, vol. 25, pp. 25-45.
`@incollection {Hamkins2014:MultiverseOnVeqL, AUTHOR = {Hamkins, Joel David}, TITLE = {A multiverse perspective on the axiom of constructibility}, BOOKTITLE = {Infinity and truth}, SERIES = {Lect. Notes Ser. Inst. Math. Sci. Natl. Univ. Singap.}, VOLUME = {25}, PAGES = {25--45}, PUBLISHER = {World Sci. Publ., Hackensack, NJ}, YEAR = {2014}, MRCLASS = {03E45 (03A05)}, MRNUMBER = {3205072}, DOI = {10.1142/9789814571043_0002}, url = {http://jdh.hamkins.org/multiverse-perspective-on-constructibility/}, eprint = {1210.6541}, }`

This article expands on an argument that I made during my talk at the Asian Initiative for Infinity: Workshop on Infinity and Truth, held July 25–29, 2011 at the Institute for Mathematical Sciences, National University of Singapore, and will be included in a proceedings volume that is being prepared for that conference.

**Abstract.**I argue that the commonly held $V\neq L$ via maximize position, which rejects the axiom of constructibility $V=L$ on the basis that it is restrictive, implicitly takes a stand in the pluralist debate in the philosophy of set theory by presuming an absolute background concept of ordinal. The argument appears to lose its force, in contrast, on an upwardly extensible concept of set, in light of the various facts showing that models of set theory generally have extensions to models of $V=L$ inside larger set-theoretic universes.In section two, I provide a few new criticisms of Maddy’s proposed concept of `restrictive’ theories, pointing out that her concept of

*fairly interpreted in*is not a transitive relation: there is a first theory that is fairly interpreted in a second, which is fairly interpreted in a third, but the first is not fairly interpreted in the third. The same example (and one can easily construct many similar natural examples) shows that neither the*maximizes over*relation,*nor*the*properly maximizes over*relation, nor the*strongly maximizes over*relation is transitive. In addition, the theory ZFC + `there are unboundedly many inaccessible cardinals’ comes out as formally restrictive, since it is strongly maximized by the theory ZF + `there is a measurable cardinal, with no worldly cardinals above it’.To support the main philosophical thesis of the article, I survey a series of mathemtical results, which reveal various senses in which the axiom of constructibility $V=L$ is compatible with strength in set theory, particularly if one has in mind the possibility of moving from one universe of set theory to a much larger one. Among them are the following, which I prove or sketch in the article:

**Observation.**The constructible universe $L$ and $V$ agree on the consistency of any constructible theory. They have models of the same constructible theories.**Theorem.**The constructible universe $L$ and $V$ have transitive models of exactly the same constructible theories in the language of set theory.**Corollary.**(Levy-Shoenfield absoluteness theorem) In particular, $L$ and $V$ satisfy the same $\Sigma_1$ sentences, with parameters hereditarily countable in $L$. Indeed, $L_{\omega_1^L}$ and $V$ satisfy the same such sentences.**Theorem.**Every countable transitive set is a countable transitive set in the well-founded part of an $\omega$-model of V=L.**Theorem.**If there are arbitrarily large $\lambda<\omega_1^L$ with $L_\lambda\models\text{ZFC}$, then every countable transitive set $M$ is a countable transitive set inside a structure $M^+$ that is a pointwise-definable model of ZFC + V=L, and $M^+$ is well founded as high in the countable ordinals as desired.**Theorem.**(Barwise) Every countable model of ZF has an end-extension to a model of ZFC + V=L.**Theorem.**(Hamkins, see here) Every countable model of set theory $\langle M,{\in^M}\rangle$, including every transitive model, is isomorphic to a submodel of its own constructible universe $\langle L^M,{\in^M}\rangle$. In other words, there is an embedding $j:M\to L^M$, which is elementary for quantifier-free assertions.Another way to say this is that every countable model of set theory is a submodel of a model isomorphic to $L^M$. If we lived inside $M$, then by adding new sets and elements, our universe could be transformed into a copy of the constructible universe $L^M$.

(Plus, the article contains some nice diagrams.)

Related Singapore links:

- J. D. Hamkins, “A multiverse perspective on the axiom of constructibility,” in Infinity and truth, World Sci. Publ., Hackensack, NJ, 2014, vol. 25, pp. 25-45.
## A question for the mathematics oracle

At the Workshop on Infinity and Truth in Singapore last year, we had a special session in which the speakers were asked to imagine that they had been granted an audience with an all-knowing mathematical oracle, given the opportunity to ask a single yes-or-no question, to be truthfully answered. These questions will be gathered together and published in the conference volume. Here is my account.

## A question for the mathematics oracle

### Joel David Hamkins, The City University of New York

Granted an audience with an all-knowing mathematics oracle, we may ask a single yes-or-no question, to be truthfully answered……

I might mischievously ask the question my six-year-old daughter Hypatia often puts to our visitors:

*“Answer yes or no. Will you answer `no’?”*They stammer, caught in the liar paradox, as she giggles. But my actual question is:*Are we correct in thinking we have an absolute concept of the finite?*An absolute concept of the finite underlies many mathematician’s understanding of the nature of mathematical truth. Most mathematicians, for example, believe that we have an absolute concept of the finite, which determines the natural numbers as a unique mathematical structure—$0,1,2,$ and so on—in which arithmetic assertions have definitive truth values. We can prove after all that the second-order Peano axioms characterize $\langle\mathbb{N},S,0\rangle$ as the unique inductive structure, determined up to isomorphism by the fact that $0$ is not a successor, the successor function $S$ is one-to-one and every set containing $0$ and closed under $S$ is the whole of $\mathbb{N}$. And to be finite means simply to be equinumerous with a proper initial segment of this structure. Doesn’t this categoricity proof therefore settle the matter?

I don’t think so. The categoricity proof, which takes place in set theory, seems to my way of thinking merely to push the absoluteness question for finiteness off to the absoluteness question for sets instead. And surely this is a murkier realm, where already mathematicians do not universally agree that we have a single absolute background concept of set. We know by forcing and other means how to construct alternative set concepts, which seem fully as legitimate and set-theoretic as the set concepts from which they are derived. Thus, we have a plurality of set concepts, and our confidence in a unique absolute set-theoretic background is weakened. How then can we sensibly base our confidence in an absolute concept of the finite on set theory? Perhaps this absoluteness is altogether illusory.

My worries are put to rest if the oracle should answer positively. A negative answer, meanwhile, would raise alarms. A negative answer could indicate, on the one hand, that our understanding of the finite is simply incoherent, a catastrophe, where our cherished mathematical theories are all inconsistent. But, more likely in my view, a negative answer could also mean that there is an undiscovered plurality of concepts of the finite. I imagine technical developments arising that would provide us with tools to modify the arithmetic of a model of set theory, for example, with the same power and flexibility that forcing currently allows us to modify higher-order features, while not providing us with any reason to prefer one arithmetic to another (unlike our current methods with non-standard models). The discovery of such tools would be an amazing development in mathematics and lead to radical changes in our conception of mathematical truth.

Let’s have some fun—please post your question for the oracle in the comment fields below.

A question for the math oracle (pdf) | My talk at the Workshop

## Moving up and down in the generic multiverse

- J. D. Hamkins and B. Löwe, “Moving up and down in the generic multiverse,” Logic and its Applications, ICLA 2013 LNCS, vol. 7750, pp. 139-147, 2013.
`@ARTICLE{HamkinsLoewe2013:MovingUpAndDownInTheGenericMultiverse, AUTHOR = {Joel David Hamkins and Benedikt L\"owe}, title = {Moving up and down in the generic multiverse}, journal = {Logic and its Applications, ICLA 2013 LNCS}, publisher={Springer Berlin Heidelberg}, editor={Lodaya, Kamal}, isbn={978-3-642-36038-1}, year = {2013}, volume = {7750}, number = {}, pages = {139--147}, doi={10.1007/978-3-642-36039-8_13}, month = {}, note = {}, url = {http://jdh.hamkins.org/up-and-down-in-the-generic-multiverse}, url = {http://arxiv.org/abs/1208.5061}, eprint = {1208.5061}, abstract = {}, keywords = {}, source = {}, }`

In this extended abstract we investigate the

*modal logic of the generic multiverse,*which is a bimodal logic with operators corresponding to the relations “is a forcing extension of”‘ and “is a ground model of”. The fragment of the first relation is the*modal logic of forcing*and was studied by us in earlier work. The fragment of the second relation is the*modal logic of grounds*and will be studied here for the first time. In addition, we discuss which combinations of modal logics are possible for the two fragments.The main theorems are as follows:

**Theorem.**If ZFC is consistent, then there is a model of ZFC whose modal logic of forcing and modal logic of grounds are both S4.2.**Theorem**. If the theory “$L_\delta\prec L+\delta$ is inaccessible” is consistent, then there is a model of set theory whose modal logic of forcing is S4.2 and whose modal logic of grounds is S5.**Theorem**. If the theory “$L_\delta\prec L+\delta$ is inaccessible” is consistent, then there is a model of set theory whose modal logic of forcing is S5 and whose modal logic of grounds is S4.2.**Theorem**. There is no model of set theory such that both its modal logic of forcing and its modal logic of grounds are S5.The current article is a brief extended abstract (10 pages). A fuller account with more detailed proofs and further information will be provided in a subsequent articl

eprints: ar$\chi$iv | NI12059-SAS | Hamburg #450

- J. D. Hamkins and B. Löwe, “Moving up and down in the generic multiverse,” Logic and its Applications, ICLA 2013 LNCS, vol. 7750, pp. 139-147, 2013.
## Structural connections between a forcing class and its modal logic

- J. D. Hamkins, G. Leibman, and B. Löwe, “Structural connections between a forcing class and its modal logic,” Israel J. Math., vol. 207, iss. 2, pp. 617-651, 2015.
`@article {HamkinsLeibmanLoewe2015:StructuralConnectionsForcingClassAndItsModalLogic, AUTHOR = {Hamkins, Joel David and Leibman, George and L{\"o}we, Benedikt}, TITLE = {Structural connections between a forcing class and its modal logic}, JOURNAL = {Israel J. Math.}, FJOURNAL = {Israel Journal of Mathematics}, VOLUME = {207}, YEAR = {2015}, NUMBER = {2}, PAGES = {617--651}, ISSN = {0021-2172}, MRCLASS = {03E40 (03B45)}, MRNUMBER = {3359713}, DOI = {10.1007/s11856-015-1185-5}, url = {http://jdh.hamkins.org/a-forcing-class-and-its-modal-logic}, eprint = {1207.5841}, }`

The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting $\square$ as “in all forcing extensions” and $\Diamond$ as “in some forcing extension”. In this modal language one may easily express sweeping general forcing principles, such as $\Diamond\square\varphi\to\square\Diamond\varphi$, the assertion that every possibly necessary statement is necessarily possible, which is valid for forcing, or $\Diamond\square\varphi\to\varphi$, the assertion that every possibly necessary statement is true, which is the maximality principle, a forcing axiom independent of but equiconsistent with ZFC (see A simple maximality principle).

Every definable forcing class similarly gives rise to the corresponding forcing modalities, for which one considers extensions only by forcing notions in that class. In previous work, we proved that if ZFC is consistent, then the ZFC-provably valid principles of the class of all forcing are precisely the assertions of the modal theory S4.2 (see The modal logic of forcing). In this article, we prove that the provably valid principles of collapse forcing, Cohen forcing and other classes are in each case exactly S4.3; the provably valid principles of c.c.c. forcing, proper forcing, and others are each contained within S4.3 and do not contain S4.2; the provably valid principles of countably closed forcing, CH-preserving forcing and others are each exactly S4.2; and the provably valid principles of $\omega_1$-preserving forcing are contained within S4.tBA. All these results arise from general structural connections we have identified between a forcing class and the modal logic of forcing to which it gives rise, including the connection between various control statements, such as buttons, switches and ratchets, and their corresponding forcing validities. These structural connections therefore support a forcing-only analysis of other diverse forcing classes.

Preprints available at: ar$\chi$iv | NI12055-SAS | UvA ILLC PP-2012-19 | HBM 446

- J. D. Hamkins, G. Leibman, and B. Löwe, “Structural connections between a forcing class and its modal logic,” Israel J. Math., vol. 207, iss. 2, pp. 617-651, 2015.
## Well-founded Boolean ultrapowers as large cardinal embeddings

- J. D. Hamkins and D. Seabold, “Well-founded Boolean ultrapowers as large cardinal embeddings,” , pp. 1-40. (preprint http://jdh.hamkins.org/boolean-ultrapowers/)
`@ARTICLE{HamkinsSeabold:BooleanUltrapowers, AUTHOR = "Joel David Hamkins and Daniel Seabold", TITLE = "Well-founded {Boolean} ultrapowers as large cardinal embeddings", JOURNAL = "", YEAR = "", volume = "", number = "", pages = "1--40", month = "", note = "preprint http://jdh.hamkins.org/boolean-ultrapowers/", eprint = "1206.6075", url = {http://arxiv.org/abs/1206.6075}, abstract = "", keywords = "", source = "", file = F }`

Boolean ultrapowers extend the classical ultrapower construction to work with ultrafilters on any complete Boolean algebra, rather than only on a power set algebra. When they are well-founded, the associated Boolean ultrapower embeddings exhibit a large cardinal nature, and the Boolean ultrapower construction thereby unifies two central themes of set theory—forcing and large cardinals—by revealing them to be two facets of a single underlying construction, the Boolean ultrapower.

The topic of this article was the focus of my tutorial lecture series at the Young Set Theorists Workshop at the Hausdorff Center for Mathematics in Königswinter near Bonn, Germany, March 21-25, 2011.

- J. D. Hamkins and D. Seabold, “Well-founded Boolean ultrapowers as large cardinal embeddings,” , pp. 1-40. (preprint http://jdh.hamkins.org/boolean-ultrapowers/)
## Is the dream solution of the continuum hypothesis attainable?

- J. D. Hamkins, “Is the dream solution of the continuum hypothesis attainable?,” Notre Dame J. Form. Log., vol. 56, iss. 1, pp. 135-145, 2015.
`@article {Hamkins2015:IsTheDreamSolutionToTheContinuumHypothesisAttainable, AUTHOR = {Hamkins, Joel David}, TITLE = {Is the dream solution of the continuum hypothesis attainable?}, JOURNAL = {Notre Dame J. Form. Log.}, FJOURNAL = {Notre Dame Journal of Formal Logic}, VOLUME = {56}, YEAR = {2015}, NUMBER = {1}, PAGES = {135--145}, ISSN = {0029-4527}, MRCLASS = {03E50}, MRNUMBER = {3326592}, MRREVIEWER = {Marek Balcerzak}, DOI = {10.1215/00294527-2835047}, eprint = {1203.4026}, url = {http://jdh.hamkins.org/dream-solution-of-ch}, }`

Many set theorists yearn for a definitive solution of the continuum problem, what I call a

*dream solution*, one by which we settle the continuum hypothesis (CH) on the basis of a new fundamental principle of set theory, a missing axiom, widely regarded as true, which determines the truth value of CH. In an earlier article, I have described the dream solution template as proceeding in two steps: first, one introduces the new set-theoretic principle, considered obviously true for sets in the same way that many mathematicians find the axiom of choice or the axiom of replacement to be true; and second, one proves the CH or its negation from this new axiom and the other axioms of set theory. Such a situation would resemble Zermelo’s proof of the ponderous well-order principle on the basis of the comparatively natural axiom of choice and the other Zermelo axioms. If achieved, a dream solution to the continuum problem would be remarkable, a cause for celebration.In this article, however, I argue that a dream solution of CH has become impossible to achieve. Specifically, what I claim is that our extensive experience in the set-theoretic worlds in which CH is true and others in which CH is false prevents us from looking upon any statement settling CH as being obviously true. We simply have had too much experience by now with the contrary situation. Even if set theorists initially find a proposed new principle to be a natural, obvious truth, nevertheless once it is learned that the principle settles CH, then this preliminary judgement will evaporate in the face of deep experience with the contrary, and set-theorists will look upon the statement merely as an intriguing generalization or curious formulation of CH or $\neg$CH, rather than as a new fundamental truth. In short, success in the second step of the dream solution will inevitably undermine success in the first step.

This article is based upon an argument I gave during the course of a three-lecture tutorial on set-theoretic geology at the summer school Set Theory and Higher-Order Logic: Foundational Issues and Mathematical Development, at the University of London, Birkbeck in August 2011. Much of the article is adapted from and expands upon the corresponding section of material in my article The set-theoretic multiverse.

- J. D. Hamkins, “Is the dream solution of the continuum hypothesis attainable?,” Notre Dame J. Form. Log., vol. 56, iss. 1, pp. 135-145, 2015.
## Set-theoretic geology

- G. Fuchs, J. D. Hamkins, and J. Reitz, “Set-theoretic geology,” Annals of Pure and Applied Logic, vol. 166, iss. 4, pp. 464-501, 2015.
`@article{FuchsHamkinsReitz2015:Set-theoreticGeology, author = "Gunter Fuchs and Joel David Hamkins and Jonas Reitz", title = "Set-theoretic geology", journal = "Annals of Pure and Applied Logic", volume = "166", number = "4", pages = "464--501", year = "2015", note = "", MRCLASS = {03E55 (03E40 03E45 03E47)}, MRNUMBER = {3304634}, issn = "0168-0072", doi = "10.1016/j.apal.2014.11.004", eprint = "1107.4776", url = "http://jdh.hamkins.org/set-theoreticgeology", }`

A ground of the universe V is a transitive proper class W subset V, such that W is a model of ZFC and V is obtained by set forcing over W, so that V = W[G] for some W-generic filter G subset P in W . The model V satisfies the ground axiom GA if there are no such W properly contained in V . The model W is a bedrock of V if W is a ground of V and satisfies the ground axiom. The mantle of V is the intersection of all grounds of V . The generic mantle of V is the intersection of all grounds of all set-forcing extensions of V . The generic HOD, written gHOD, is the intersection of all HODs of all set-forcing extensions. The generic HOD is always a model of ZFC, and the generic mantle is always a model of ZF. Every model of ZFC is the mantle and generic mantle of another model of ZFC. We prove this theorem while also controlling the HOD of the final model, as well as the generic HOD. Iteratively taking the mantle penetrates down through the inner mantles to what we call the outer core, what remains when all outer layers of forcing have been stripped away. Many fundamental questions remain open.

- G. Fuchs, J. D. Hamkins, and J. Reitz, “Set-theoretic geology,” Annals of Pure and Applied Logic, vol. 166, iss. 4, pp. 464-501, 2015.
## The set-theoretical multiverse

- J. D. Hamkins, “The set-theoretic multiverse,” Review of Symbolic Logic, vol. 5, pp. 416-449, 2012.
`@ARTICLE{Hamkins2012:TheSet-TheoreticalMultiverse, AUTHOR = {Joel David Hamkins}, TITLE = {The set-theoretic multiverse}, JOURNAL = {Review of Symbolic Logic}, YEAR = {2012}, volume = {5}, number = {}, pages = {416--449}, month = {}, note = {}, url = {}, doi = {10.1017/S1755020311000359}, abstract = {}, keywords = {}, source = {}, eprint = {1108.4223}, url = {http://jdh.hamkins.org/themultiverse}, }`

The multiverse view in set theory, introduced and argued for in this article, is the view that there are many distinct concepts of set, each instantiated in a corresponding set-theoretic universe. The universe view, in contrast, asserts that there is an absolute background set concept, with a corresponding absolute set-theoretic universe in which every set-theoretic question has a definite answer. The multiverse position, I argue, explains our experience with the enormous diversity of set-theoretic possibilities, a phenomenon that challenges the universe view. In particular, I argue that the continuum hypothesis is settled on the multiverse view by our extensive knowledge about how it behaves in the multiverse, and as a result it can no longer be settled in the manner formerly hoped for.

Multiversive at n-Category Cafe | Multiverse on Mathoverflow

- J. D. Hamkins, “The set-theoretic multiverse,” Review of Symbolic Logic, vol. 5, pp. 416-449, 2012.
## The set-theoretical multiverse: a natural context for set theory, Japan 2009

- J. D. Hamkins, “The Set-theoretic Multiverse : A Natural Context for Set Theory,” Annals of the Japan Association for Philosophy of Science, vol. 19, pp. 37-55, 2011.
`@article{Hamkins2011:TheMultiverse:ANaturalContext, author="Joel David Hamkins", title="The Set-theoretic Multiverse : A Natural Context for Set Theory", journal="Annals of the Japan Association for Philosophy of Science", ISSN="0453-0691", publisher="the Japan Association for Philosophy of Science", year="2011", volume="19", number="", pages="37--55", URL="http://ci.nii.ac.jp/naid/110008722567/en/", DOI="", }`

This article is based on a talk I gave at the conference in honor of the retirement of Yuzuru Kakuda in Kobe, Japan, March 7, 2009. I would like to express my gratitude to Kakuda-sensei and the rest of the logic group in Kobe for the opportunities provided to me to participate in logic in Japan. In particular, my time as a JSPS Fellow in the logic group at Kobe University in 1998 was a formative experience. I was part of a vibrant research group in Kobe; I enjoyed Japanese life, learned to speak a little Japanese and made many friends. Mathematically, it was a productive time, and after years away how pleasant it is for me to see that ideas planted at that time, small seedlings then, have grown into tall slender trees.

Set theorists often take their subject as constituting a foundation for the rest of mathematics, in the sense that other abstract mathematical objects can be construed fundamentally as sets. In this way, they regard the set-theoretic universe as the universe of all mathematics. And although many set-theorists affirm the Platonic view that there is just one universe of all sets, nevertheless the most powerful set-theoretic tools developed over the past half century are actually methods of constructing alternative universes. With forcing and other methods, we can now produce diverse models of ZFC set theory having precise, exacting features. The fundamental object of study in set theory has thus become the model of set theory, and the subject consequently begins to exhibit a category-theoretic second-order nature. We have a multiverse of set-theoretic worlds, connected by forcing and large cardinal embeddings like constellations in a dark sky. In this article, I will discuss a few emerging developments illustrating this second-order nature. The work engages pleasantly with various philosophical views on the nature of mathematical existence.

- J. D. Hamkins, “The Set-theoretic Multiverse : A Natural Context for Set Theory,” Annals of the Japan Association for Philosophy of Science, vol. 19, pp. 37-55, 2011.
## A natural model of the multiverse axioms

- V. Gitman and J. D. Hamkins, “A natural model of the multiverse axioms,” Notre Dame J.~Form.~Log., vol. 51, iss. 4, pp. 475-484, 2010.
`@ARTICLE{GitmanHamkins2010:NaturalModelOfMultiverseAxioms, AUTHOR = {Gitman, Victoria and Hamkins, Joel David}, TITLE = {A natural model of the multiverse axioms}, JOURNAL = {Notre Dame J.~Form.~Log.}, FJOURNAL = {Notre Dame Journal of Formal Logic}, VOLUME = {51}, YEAR = {2010}, NUMBER = {4}, PAGES = {475--484}, ISSN = {0029-4527}, MRCLASS = {03E40}, MRNUMBER = {2741838}, DOI = {10.1215/00294527-2010-030}, URL = {http://dx.doi.org/10.1215/00294527-2010-030}, eprint = {1104.4450}, }`

In this article, we prove that if ZFC is consistent, then the collection of countable computably saturated models of ZFC satisfies all of the Multiverse Axioms that I introduced in my paper, “The set-theoretic multiverse.”

- V. Gitman and J. D. Hamkins, “A natural model of the multiverse axioms,” Notre Dame J.~Form.~Log., vol. 51, iss. 4, pp. 475-484, 2010.
## Some second order set theory

- J. D. Hamkins, “Some second order set theory,” in Logic and its applications, R.~Ramanujam and S.~Sarukkai, Eds., Berlin: Springer, 2009, vol. 5378, pp. 36-50.
`@INCOLLECTION{Hamkins2009:SomeSecondOrderSetTheory, AUTHOR = {Hamkins, Joel David}, TITLE = {Some second order set theory}, BOOKTITLE = {Logic and its applications}, SERIES = {Lecture Notes in Comput.~Sci.}, VOLUME = {5378}, PAGES = {36--50}, PUBLISHER = {Springer}, EDITOR = {R.~Ramanujam and S.~Sarukkai}, ADDRESS = {Berlin}, YEAR = {2009}, MRCLASS = {03E35 (03B45 03E40)}, MRNUMBER = {2540935 (2011a:03053)}, DOI = {10.1007/978-3-540-92701-3_3}, URL = {http://dx.doi.org/10.1007/978-3-540-92701-3_3}, }`

This article surveys two recent developments in set theory sharing an essential second-order nature, namely, the modal logic of forcing, oriented upward from the universe of set theory to its forcing extensions; and set-theoretic geology, oriented downward from the universe to the inner models over which it arises by forcing. The research is a mixture of ideas from several parts of logic, including, of course, set theory and forcing, but also modal logic, finite combinatorics and the philosophy of mathematics, for it invites a mathematical engagement with various philosophical views on the nature of mathematical existence.- J. D. Hamkins, “Some second order set theory,” in Logic and its applications, R.~Ramanujam and S.~Sarukkai, Eds., Berlin: Springer, 2009, vol. 5378, pp. 36-50.
## The ground axiom is consistent with $V\ne{\rm HOD}$

- J. D. Hamkins, J. Reitz, and W. Woodin, “The ground axiom is consistent with $V\ne{\rm HOD}$,” Proc.~Amer.~Math.~Soc., vol. 136, iss. 8, pp. 2943-2949, 2008.
`@ARTICLE{HamkinsReitzWoodin2008:TheGroundAxiomAndVequalsHOD, AUTHOR = {Hamkins, Joel David and Reitz, Jonas and Woodin, W.~Hugh}, TITLE = {The ground axiom is consistent with {$V\ne{\rm HOD}$}}, JOURNAL = {Proc.~Amer.~Math.~Soc.}, FJOURNAL = {Proceedings of the American Mathematical Society}, VOLUME = {136}, YEAR = {2008}, NUMBER = {8}, PAGES = {2943--2949}, ISSN = {0002-9939}, CODEN = {PAMYAR}, MRCLASS = {03E35 (03E45 03E55)}, MRNUMBER = {2399062 (2009b:03137)}, MRREVIEWER = {P{\'e}ter Komj{\'a}th}, DOI = {10.1090/S0002-9939-08-09285-X}, URL = {http://dx.doi.org/10.1090/S0002-9939-08-09285-X}, file = F }`

Abstract. The Ground Axiom asserts that the universe is not a nontrivial set-forcing extension of any inner model. Despite the apparent second-order nature of this assertion, it is first-order expressible in set theory. The previously known models of the Ground Axiom all satisfy strong forms of $V=\text{HOD}$. In this article, we show that the Ground Axiom is relatively consistent with $V\neq\text{HOD}$. In fact, every model of ZFC has a class-forcing extension that is a model of $\text{ZFC}+\text{GA}+V\neq\text{HOD}$. The method accommodates large cardinals: every model of ZFC with a supercompact cardinal, for example, has a class-forcing extension with $\text{ZFC}+\text{GA}+V\neq\text{HOD}$ in which this supercompact cardinal is preserved.

- J. D. Hamkins, J. Reitz, and W. Woodin, “The ground axiom is consistent with $V\ne{\rm HOD}$,” Proc.~Amer.~Math.~Soc., vol. 136, iss. 8, pp. 2943-2949, 2008.
## The modal logic of forcing

- J. D. Hamkins and B. Löwe, “The modal logic of forcing,” Trans.~Amer.~Math.~Soc., vol. 360, iss. 4, pp. 1793-1817, 2008.
`@ARTICLE{HamkinsLoewe2008:TheModalLogicOfForcing, AUTHOR = {Hamkins, Joel David and L{\"o}we, Benedikt}, TITLE = {The modal logic of forcing}, JOURNAL = {Trans.~Amer.~Math.~Soc.}, FJOURNAL = {Transactions of the American Mathematical Society}, VOLUME = {360}, YEAR = {2008}, NUMBER = {4}, PAGES = {1793--1817}, ISSN = {0002-9947}, CODEN = {TAMTAM}, MRCLASS = {03E40 (03B45)}, MRNUMBER = {2366963 (2009h:03068)}, MRREVIEWER = {Andreas Blass}, DOI = {10.1090/S0002-9947-07-04297-3}, URL = {http://dx.doi.org/10.1090/S0002-9947-07-04297-3}, eprint = {math/0509616}, file = F }`

What are the most general principles in set theory relating forceability and truth? As with Solovay’s celebrated analysis of provability, both this question and its answer are naturally formulated with modal logic. We aim to do for forceability what Solovay did for provability. A set theoretical assertion $\psi$ is forceable or possible, if $\psi$ holds in some forcing extension, and necessary, if $\psi$ holds in all forcing extensions. In this forcing interpretation of modal logic, we establish that if ZFC is consistent, then the ZFC-provable principles of forcing are exactly those in the modal theory known as S4.2.

Follow-up article: Structural connections between a forcing class and its modal logic

- J. D. Hamkins and B. Löwe, “The modal logic of forcing,” Trans.~Amer.~Math.~Soc., vol. 360, iss. 4, pp. 1793-1817, 2008.
## The Ground Axiom

- J. D. Hamkins, “The Ground Axiom,” Mathematisches Forschungsinstitut Oberwolfach Report, vol. 55, pp. 3160-3162, 2005.
`@ARTICLE{Hamkins2005:TheGroundAxiom, AUTHOR = "Joel David Hamkins", TITLE = "The {Ground Axiom}", JOURNAL = "Mathematisches Forschungsinstitut Oberwolfach Report", YEAR = "2005", volume = "55", number = "", pages = "3160--3162", month = "", note = "", abstract = "", keywords = "", source = "", file = F }`

This is an extended abstract for a talk I gave at the 2005 Workshop in Set Theory at the Mathematisches Forschungsinstitut Oberwolfach.

Oberwolfach Research Report 55/2005 | Ground Axiom on Wikipedia

- J. D. Hamkins, “The Ground Axiom,” Mathematisches Forschungsinstitut Oberwolfach Report, vol. 55, pp. 3160-3162, 2005.
## A simple maximality principle

- J. D. Hamkins, “A simple maximality principle,” J.~Symbolic Logic, vol. 68, iss. 2, pp. 527-550, 2003.
`@article{Hamkins2003:MaximalityPrinciple, AUTHOR = {Hamkins, Joel David}, TITLE = {A simple maximality principle}, JOURNAL = {J.~Symbolic Logic}, FJOURNAL = {The Journal of Symbolic Logic}, VOLUME = {68}, YEAR = {2003}, NUMBER = {2}, PAGES = {527--550}, ISSN = {0022-4812}, CODEN = {JSYLA6}, MRCLASS = {03E35 (03E40)}, MRNUMBER = {1976589 (2005a:03094)}, MRREVIEWER = {Ralf-Dieter Schindler}, DOI = {10.2178/jsl/1052669062}, URL = {http://projecteuclid.org/getRecord?id=euclid.jsl/1052669062}, month = {June}, eprint = {math/0009240}, }`

In this paper, following an idea of Christophe Chalons, I propose a new kind of forcing axiom, the Maximality Principle, which asserts that any sentence$\varphi$ holding in some forcing extension $V^{\mathbb{P}}$ and all subsequent extensions $V^{\mathbb{P}*\mathbb{Q}}$ holds already in $V$. It follows, in fact, that such sentences must also hold in all forcing extensions of $V$. In modal terms, therefore, the Maximality Principle is expressed by the scheme $(\Diamond\Box\varphi)\to\Box\varphi$, and is equivalent to the modal theory S5. In this article, I prove that the Maximality Principle is relatively consistent with ZFC. A boldface version of the Maximality Principle, obtained by allowing real parameters to appear in $\varphi$, is equiconsistent with the scheme asserting that $V_\delta$ is an elementary substructure of $V$ for an inaccessible cardinal $\delta$, which in turn is equiconsistent with the scheme asserting that ORD is Mahlo. The strongest principle along these lines is the Necessary Maximality Principle, which asserts that the boldface MP holds in V and all forcing extensions. From this, it follows that $0^\sharp$ exists, that $x^\sharp$ exists for every set $x$, that projective truth is invariant by forcing, that Woodin cardinals are consistent and much more. Many open questions remain.

- J. D. Hamkins, “A simple maximality principle,” J.~Symbolic Logic, vol. 68, iss. 2, pp. 527-550, 2003.