The Axiom of Choice in the -Mantle
Abstract
Usuba has asked whether the -mantle, the intersection of all grounds that extend to via a forcing of size , is always a model of . We give a negative answers by constructing counterexamples where is a Mahlo cardinal, and where is the successor of a regular uncountable cardinal.
1 Introduction
Set-Theoretic Geology is the study of the structure of grounds, that is inner models of that extend to via forcing, and associated concepts. Motivated by the hope to uncover canonical structure hidden underneath generic sets, the mantle was born.
Definition 1.1.
The mantle, denoted , is the intersection of all grounds.
This definition only makes sense due to the uniform definability of grounds.
Fact 1.2.
There is a first order -formula such that
defines a ground for all and all grounds are of this form. Moreover, if is a cardinal and extends to via a forcing of size then there is with .
This was proven independently by Woodin [Woo11] [Woo04], Laver [Lav07] and was later strengthened by Hamkins, see [FHR15].
This allows us to quantify freely over grounds as we will frequently do.
It was quickly realized that every model of is the mantle of another model of , see [FHR15], which eradicated any chance of finding nontrivial structure in the mantle. However, the converse question remained open for some while, namely whether the mantle is provably a model of . This tough nut was cracked by Toshimichi Usuba.
Fact 1.3 (Usuba,[Usu17]).
The mantle is always a model of .
Thereby the mantle was established as a well behaved canonical object in the theory of forcing. Fuchs-Hamkins-Reitz [FHR15] suggested to study restricted forms of the mantle.
Definition 1.4.
Let be a class333In this case, we think of as a definition, possibly with ordinal parameters, so that can be evaluated grounds of . of forcings.
-
A -ground is a ground that extends to via a forcing .
-
The -mantle is the intersection of all -grounds.
-
We say that the -grounds are downwards directed if for any two -grounds there is a -ground .
-
We say that the -grounds are downwards set-directed if for any set-indexed collection of -grounds there is a -ground contained in all for .
-
We say that is ground absolute if the -grounds of a -ground are exactly those common grounds of and that are -grounds from the perspective of , i.e. being a -ground is absolute between and all -grounds.
Remark 1.5.
Note that if is provably (in ) closed under quotients and two-step iterations then is ground absolute.
Fuchs-Hamkins-Reitz [FHR15] have shown abstractly that if is ground absolute and has directed grounds then . To prove they seemingly need the stronger assumption that the -grounds are downwards set-directed, the argument is as follows: Suppose is not wellordered in . Then for every wellorder of , we choose a -ground from which is missing. By downwards set directedness, there is a -ground contained in all such grounds , but then is not wellordered in either, contradiction. The main result of this part shows that indeed simple downwards directedness does not suffice to prove choice in in general.
We will be interested in for the class of all forcings of size , where is some given cardinal. In this case, we denote the -mantle by and call it the -mantle. The associated grounds are the -grounds. The interest of the -mantle arose in different contexts.
The following is known:
Fact 1.6 (Usuba, [Usu18]).
If is a strong limit then .
Usuba proved this by showing that the -grounds are directed in this case. Usuba subsequently asked:
Question 1.7 (Usuba, [Usu18]).
Is always a model of ?
We will answer this question in the negative by providing counterexamples for three different types of cardinals .
We also mention that Fuchs-Hamkins-Reitz demonstrated that can fail to be a model of choice for a different class of forcings, .
Fact 1.8 (Fuchs-Hamkins-Reitz, [FHR15]).
If is the class of all -closed forcings it is consistent that .
It turns out that there is an interesting tension between large cardinal properties of and the failure of choice in . On the one side, Usuba has shown:
Fact 1.9 (Usuba, [Usu18]).
If is extendible then . In particular is a model of .
Indeed, this result was the initial motivation of investigating the -mantle. Sargsyan-Schindler [SS18] showed that a similar situation arises in the least iterable inner model with a strong cardinal above a Woodin cardinal for the unique strong cardinal in this universe. See also [SSS21] and [Sch22b] for further results in this direction.
On another note, Schindler has proved the following.
Fact 1.10 (Schindler, [Sch18]).
If is measurable then .
The big difference to Fact 1.9 is that the existence of a measurable is consistent with the failure of the Bedrock Axiom444The Bedrock Axiom states that the universe has a minimal ground, which turns out to be equivalent to “ is a ground”.. Particularly, we might have for measurable.
If we go even lower in the large cardinal hierarchy then even less choice principles seem to be provable in the corresponding mantle. The relevant results here are due to Farmer Schlutzenberg.
Fact 1.11 (Schlutzenberg, [Sch22a]).
Suppose that is weakly compact. Then
-
and
-
for every ,
Definition 1.12.
Suppose is an ordinal and is a set. -choice holds if for any and any sequence of nonempty elements of there is a choice sequence for , that is a sequenece with for all .
Fact 1.13 (Schlutzenberg, [Sch22a]).
Suppose is inaccessible. Then we have
-
and
-
.
Acknowledgments
The author thanks Ralf Schindler and Farmer Schlutzenberg for valuable discussions on the present topic. Moreover, the author thanks Ralf Schindler for his support and guidance during his work on this project.
Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research
Foundation) under Germany’s Excellence Strategy EXC 2044 390685587, Mathematics Münster:
Dynamics - Geometry - Structure.
2 Overview
In Section 3.1, we will argue that “ is measurable” cannot be replaced by “ is Mahlo” in Fact 1.10, as wells as that -choice cannot be strengthened to -choice in Fact 1.13.
Theorem 2.1.
If is consistent with the existence of a Mahlo cardinal, then it is consistent with that there is a Mahlo cardinal so that fails to satisfy the axiom of choice. In fact we may have
In Section 3.2, we will investigate the -mantle for , as well as the -mantle where , denoted by . We will first proof that these mantles are always models of and will go on to provide a result analogous to Theorem 2.1.
Theorem 2.2.
It is consistent relative to a Mahlo cardinal that both and fail to satisfy the axiom of choice.
In Section 3.3, we will generalize this to any successor of a regular cardinal.
Theorem 2.3.
Suppose that
-
holds,
-
the Ground Axiom555The Ground Axiom states that there is no nontrivial ground. See [Rei06] for more information on this axiom. holds and
-
is a regular uncountable cardinal.
Then there is a cardinal preserving generic extension in which the -mantle fails to satisfy the axiom of choice.
In this case however, it is not known if the -mantle is a model of in general. The proof of all these three theorems follows a similar pattern, though the details differ from case to case and it seems that we cannot employ a fully unified approach.
3 The Axiom of Choice May Fail in
3.1 The case “ is Mahlo”
Here, we will construct a model where the -mantle for a Mahlo cardinal does not satisfy the axiom of choice. We will start with and assume that is the least Mahlo there. The final model will be a forcing extension of by
where is the class of all inaccessible cardinals. We define to be a product forcing and not an iteration (in the usual sense), as we want to generate many -grounds. Let be -generic over . We will show that is still Mahlo in and that does not satisfy the axiom of choice. We remark that, would we start with a model in which is measurable, would provably force to not be measurable.
First, let’s fix notation. For , we may factor as where in each case we only take a product over all with and respectively. Observe that is a -support product while is a full support product. We also factor as accordingly. For we denote the generic for induced by as . In addition to this, for we denote the -th inaccessible cardinal by .
For let be the function induced by . It will be convenient to think of as a -matrix which arises by stacking the maps on top of each other, starting with and proceeding downwards, and then filling up with ’s to produce rows of equal length . Let us write
The are the entries of :
We will give the -th row of the name and we denote the -th column of by . One trivial but key observation is that carries the same information as .
We will be frequently interested in the matrix with its first rows deleted for some , so we will give this matrix the name . Note that corresponds to the generic . Finally observe that we may think of conditions in as partial matrices that approximate such a matrix in the sense that they already have the trivial ’s in the upper right corner, in any row they have information for many on whether is or and they contain non-trivial information in less than -many rows.
Lemma 3.1.
and have the same inaccessibles.
Proof.
First, we show that all limit cardinals of are limit cardinals in . It is enough to prove that all double successors are preserved. This is obvious for as has size . For , is -closed so that all cardinals are preserved in . Furthermore, has size at most in by in . Hence is still a cardinal in .
Now we have to argue that all remain regular. Again, this is clear if . On the other hand, assume . As is -closed, is still regular in . Hence, a witness to must be added in the extension of by . But this forcing has size in and thus could not have added such a sequence.
∎
In fact, does not collapse any cardinals (if ), but some more work is required to prove this. This is, however, not important for our purposes. Next, we aim to show that remains Mahlo in .
To prove this, it is convenient to introduce a generalization of Axiom A.
Definition 3.2.
For an ordinal, a cardinal we say that a forcing satisfies Axiom A, abbreviated by , if there is a sequence of partial orders on so that
-
,
-
for all antichains in , and there is so that and
-
for all if satisfies for all then there is a fusion of , that is for all .
Remark 3.3.
The usual Axiom A is thus Axiom A.
Proposition 3.4.
Suppose is regular uncountable cardinal and satisfies . Then preserves stationary subsets of .
Proof.
Suppose is stationary, is a -name for a club in and . We will imitate the standard proof that a -closed forcing preserves stationary sets. Let witness that satisfies .
Claim 3.5.
For any there is and some with .
Proof.
Suppose toward a contradiction that . By the claim above, we can build sequences of conditions in and an increasing sequence of ordinals below so that
-
,
-
for all and
-
for all .
Let be the set of all limit points of . For any , we have
which shows that , contradiction. ∎
Lemma 3.6.
satisfies .
Proof.
For define by if and for . We will only show that holds. So let , and a maximal antichain. Let be an enumeration of all conditions in below with . We construct a -descending sequence of conditions in starting with as follows: If then choose some -bound of . This is possible as is -closed, as the next forcing only appears at the next inaccessible. Moreover, if possible and make sure that
is below a condition in . This completes the construction. Set , we will show that is compatible with at most -many elements of . Toward this goal, suppose and is compatible with . We may find some so that . It follows that we must have succeeded in the construction of with the additional demand that
is below a condition in , but this can only be true for . We have shown that for any compatible with there is with and note that no single can witness this for more than one element of . ∎
Corollary 3.7.
is Mahlo in .
Next, we aim to find an easier description of . Recall the -approximation property introduced by Hamkins [Ham03]:
Definition 3.8.
Let be an inner model, an infinite cardinal.
-
For , a -approximation of by is of the form where is of size .
-
satisfies the -approximation property if whenever and all -approximations of by are in , then .
All -grounds satisfy the -approximation property (cf. [FHR15]).
Lemma 3.9.
.
Proof.
Suppose is a -ground of . It is enough to find such that . Clearly, . As is a limit of inaccessibles, we may take some inaccessible so that is a -ground. Thus satisfies the -approximation property. We will show (even ). Find with , it is thus enough to show . To any -approximation of by corresponds some , of size so that
We will show that all such restrictions of are in . So let , , . As does not exist in , there is , of size with . For all , the set of with is bounded in . As described earlier, we may think of conditions in as partial matrices. With this in mind, the conditions that contain information on the entry for all form a dense set of . Thus is essentially a condition and hence . As satisfies the -approximation property, we have .
∎
Remark 3.10.
The above argument shows that for any
In fact, whenever is a strong limit, the -mantle is always absolute to any -ground. The use of Jensen’s covering lemma in the above argument is not essential, in fact a model in which the -mantle does not satisfy choice for Mahlo can be analogously constructed in the presence of . However, the absence of simplifies the proof.
We will later show that does not admit a wellorder in . First, we analyze which subsets of knows of. We call fresh if for all .
Proposition 3.11.
The subsets of in are exactly the fresh subsets of in .
Proof.
First suppose , . If then . As is -closed in , .
For the other direction assume is a fresh subset of and assume is a -ground of . There is so that satisfies the -approximation property. As is fresh, all the -approximations of in are in . Thus .
∎
The columns , , of are the fresh subsets of relevant to our argument.
Proposition 3.12.
All , , are -generic over .
Proof.
The map that maps to the information that has on is well-defined as is a bounded support iteration of length . Clearly, is a projection. ∎
This is exactly the reason we chose bounded support in the definition of .
We are now in good shape to complete the argument.
Theorem 3.13.
-choice fails in .
Proof.
Note that any generic for is the characteristic function of a fresh subset of so that for any . Of course, the sequence is not in , as one can compute the whole matrix (and thus the whole generic ) from this sequence. However, we can make this sequence fuzzy to result in an element of . Let be the equivalence relation of eventual coincidence on , i.e.
We call the fuzzy sequence.
Claim 3.14.
The fuzzy sequence is an element of .
Proof.
By Lemma 3.9, it is enough to show that for every , knows of this sequence. But contains the matrix and thus the sequence
so that can compute the relevant sequence of equivalence classes from this parameter. ∎
Finally, we argue that does not contain a choice sequence for the fuzzy sequence666That is, there is no sequence with for all .. Heading toward a contradiction, let us assume that
is such a sequence. knows about the sequence
where is the least with . The set of that are closed under the map is club in . As is Mahlo in , there is an inaccessible that is closed under . Now observe that
holds for all , so that . But this is impossible as clearly is not fresh.
∎
Theorem 2.1 follows.
Remark 3.15.
The only critical property of that we need to make sure that is not a model of choice in is that has no nontrivial grounds, i.e. satisfies the ground axiom. is convenient and implies that no cardinals are collapsed, but it is not necessary. The use of Jensen’s covering lemma can also be avoided, as discussed earlier.
3.2 The -mantle
Up to now, we have focused on the -mantle for strong limit . We will get similar results for the -mantle. There is some ambiguity in the definition of the -mantle, depending on whether or not is considered as a parameter or as a definition. In the former case, it is the intersections of all grounds so that extends to via a forcing so that , where in the latter case we would require . These mantles are in general not equal. To make the distinction clear, we give the latter version the name “Cohen mantle” and denote it by . The reason for the name is, of course, that all non-trivial countable forcings are forcing-equivalent to Cohen forcing.
Lemma 3.16.
and .
Proof.
First let us do it for . Clearly, is closed under the Gödel operations. It is thus enough to show that for all . Let be any Cohen-ground. As Cohen-forcing is homogeneous, is a definable class in . Hence, . As was arbitrary, this proves the claim.
Now onto . The above argument shows that all we need to do is show that is a definable class in all associated grounds. So let be such a ground. There are two cases. First, assume that . Then extends to via Cohen forcing, so is definable in . Next, suppose that . This can only happen if is a successor cardinal in , say . In this case, extends to via a forcing of -size and which collapses to be countable. It is well known that in this situation, extends to via , which is homogeneous as well, so once again, is a definable class in . ∎
Once again, choice can fail.
Theorem 3.17.
Relative to the existence of a Mahlo cardinal, it is consistent that there is no wellorder of in .
We remark that the Mahlo cardinal is used in a totally different way than in the last section. In the model we will construct, will be inaccessible in . Let us once again assume for the rest of the section and let be Mahlo. Let be the “-support version of ”, that is
Let us pick a -generic filter over . From now on, will denote and will denote .
Proposition 3.18.
Suppose is a forcing, and is a cardinal. If is then in there is no surjection from any onto .
Proof.
This is a straightforward adaptation of the proof that Axiom A forcings preserve . ∎
The following lemma is the only significant use of the Mahloness of .
Lemma 3.19.
satisfies .
Proof.
We define independent of as the order : Let iff and . The only nontrivial part is showing that for any antichain and any there is with
Let
for all . We will proceed to find some with the desired property. For convenience, we may assume that is a maximal antichain. As is Mahlo, there is a regular so that and any is compatible with some . As , holds. Thus there is a sequence with
-
and
-
for all there are stationarily many with .
Construct a sequence
of conditions in with for all as follows: Set . If is defined for all , let first and note that this is a condition. Let . Now find that is compatible with and let
Finally, set . We have to show that is compatible with only a few elements of , so suppose is compatible with . The properties of guarantee that there is so that
-
and
-
.
Hence in the construction of we found some compatible with and have . If , then and the incompatibility must lie in the interval . But then and are incompatible as well, contradiction. Thus and it follows that is compatible with at most -many elements of . ∎
Corollary 3.20.
We have
-
and
-
if then there is some so that .
Proof.
To see , note that collapses all cardinals to , so . As satisfies , there is no surjection from onto in .
Next, let us prove . Let be a name for . In , find a decreasing sequence of conditions in so that decides the value of (from the perspective of ). Let . By , . But then can compute the whole of .
∎
From now on, denotes and is . Let us define an auxiliary model . It is clear that .
Recall the following fact due to Solovay.
Fact 3.21 (Solovay, [Sol70]).
If are mutually generic filters over (for any forcings) then .
Proposition 3.22.
We have that
-
and
-
.
Proof.
First, we will prove . Once again it is enough to show that is definable in all models of the form for . But this is clear from the definition of .
Next, we show . is trivial. If and then for some by clause of Corollary 3.20. As , , too. Thus by Fact 3.21
The final inclusion holds since if is a ground of which extends to via of size then cannot add a fresh subset of . ∎
Proof of Theorem 3.17..
We will show that in , neither nor possess a wellorder of its version of . In fact, we will show that does not have such a wellorder, which is enough by of the above proposition. Once again, let be the equivalence relation on functions of eventual coincidence. For , let
where is the map induced by the slice of generic for . As before, we get that the fuzzy sequence . If had a wellorder of , then there would be a choice sequence for the fuzzy sequence. In , one can define the sequence where is the least point after which and coincide. As in , the are bounded uniformly by some . But this means that , a contradiction. ∎
It is natural to conjecture that , though we do not have a proof of any of these equalities. The problem is that we cannot follow the strategy from Section 3.1: has Cohen-grounds which do not contain any for , let alone a tail of the sequence .
Question 3.23.
Is ?
3.3 The successor of a regular uncountable cardinal case
We show that, again under , for every regular uncountable there is a forcing extension in which is not a model of . The upside here is that we do not need any large cardinals at all in our construction, however we pay a price: We do not know whether is a model of in general.
Theorem 3.24.
Assume and suppose is regular uncountable. Then after forcing with
is not a model of .
First, lets do a warm-up with an initial segment of . We thank Elliot Glazer for explaining (the nontrivial part of) the following argument to the author.
Lemma 3.25 (Elliot Glazer).
If is regular and holds then
satisfies .
An additional assumption beyond “ is regular” is necessary here: It is well known that
collapses to .
Proof.
We let if and . It is easy to see that and of Definition 3.2 hold, so let us show . Therefore, let , and an antichain in be given. As holds, there is a sequence with so that for any there is some with . We will define a sequence inductively so that for all . We put . At limit stages we let be the canonical fusion of . So assume is defined. We choose so that, if possible,
for some . Otherwise, we are lazy and set .
Now clearly and we will show that is compatible with at most -many conditions in . To see this, suppose is compatible with . We may find so that . In the construction of from , we tried to achieve that
is below some condition in , which is possible and only possible for . This shows that for any that is compatible with , there is so that . As has size , it follows that there are at most -many such . ∎
Corollary 3.26.
Under the same assumptions as before, preserves all cardinals .
Proof.
is -closed and satisfies . ∎
We aim to prove a similar result for .
Lemma 3.27.
If is regular and holds then preserves all cardinals . Moreover, if is -generic and is in then there is with .
The argument is similar, but somewhat more complicated. To do so, we introduce a further abstraction of .
Definition 3.28.
Suppose that is a partial order, is a forcing, are ordinals. satisfies Strategic Axiom A () if there is a family of partial orders on so that
-
whenever for ,
-
for any antichain , any and , there is with
and
-
player II has a winning strategy in the following game we call :
I II The game has length . In an even round , Player I plays some condition so that for all played so far. In an odd round , player II plays some with for all .
Player I wins the game iff some player has no legal moves in some round . If the game last all rounds instead, II wins.
It is straightforward to generalize Proposition 3.18.
Proposition 3.29.
Suppose satisfies . Then in , there is no surjection for any .
∎
Lemma 3.30.
If is regular and holds then satisfies
where is ordered by inclusion.
Proof.
For we will write if and . It is clear that holds.
Next, we aim to establish . We describe a strategy for player II in the relevant game. We will need to do some additional bookkeeping. Let
be a surjection such that if then . Suppose that is the last condition played by player I and have been played already. In the background, we already have chosen some surjections for and we will adjoin a surjection to that list. We set
where . As is regular, .
Claim 3.31.
Player I does not run out of moves before the game ends.
Proof.
Suppose we reached round and let . We will find a legal play for player I. For , let be trivial. The point is that for , stabilizes eventually to some . If , then our bookkeeping made sure that we have
so that is already fully defined and a legal play. If instead, then there are possibly , but then is a sequence of length , so we may pick a lower bound for it. ∎
It remains to show and here we will use that holds. Let be the “-sequence for ” that appeared in the proof of Lemma 3.25 and let be a maximal antichain in . Choose to be a winning strategy for player II in and we will describe a strategy for player I: Suppose and , have already been played for . This time, we will have picked some surjections for in the background. Let . Then, assuming there is a legal move, pick some so that
-
for all and
-
if possible, is below a condition in
where is defined by
whenever and (and is trivial where we did not specify a value)777 may fail to be a function, in which case is void..
Let , be the sequences of moves played by player I and II in a game where player I follows and player II follows . As is a winning strategy, the sequence must be of length . We will show that is compatible with at most -many elements of . So let and assume that is compatible with .
Claim 3.32.
There is so that and .
Proof.
We define by whenever . Then there is with
-
and
-
.
It is easy to see now that is as desired. ∎
Thus in round in the game, player I tried to make sure that
is below some condition in . This is possible for , and only for as and are compatible.
We have shown that for any that is compatible with , there is such that . As there are only -many with support contained in , this implies that there are at most -many such .
∎
Remark 3.33.
If additionally holds at then does not collapse any cardinals at all by a standard -system argument.
Proof of Theorem 3.24..
Let be -generic over . By Lemma 3.27, all -cardinals are still cardinals in (in fact, all cardinals are preserved). Let . Using that is definable in every model of the form , it is easy to check that is a model of . Once again, we call fresh if for all .
Claim 3.34.
.
Proof.
We will show that there is no wellorder of in . So assume otherwise. Let be the equivalence relation of eventual coincidence on in . We can realise as a matrix where the -th row is -generic over . Now the columns are in fact -generic over . Let us write for the -th column ( and for the -th row (). For any we have that . Thus
and by our assumption there must be a choice function, say , in . In , we can define the sequence , where is the least point after which and coincide. As is not collapsed by , we can strictly bound all by some . But then
is -generic over , which contradicts that and have the same subsets of . ∎
Note that Fact 1.6 does not apply in the situation here, so we may ask:
Question 3.35.
Is a model of ? Is ?
4 Conclusion
There are a number of open questions regarding the interplay between large cardinal properties of and the -mantle. The following table summarizes what is known as presented in the introduction.
Large cardinal property of | Theory of extends… |
---|---|
extendible | |
measurable | |
weakly compact | |
inaccessible |
There is certainly much more to discover here. How optimal are these results? Optimality has only been proven for one of them, namely the first. This is due to Gabriel Goldberg.
Fact 4.1 (Goldberg, [Gol21]).
Suppose is an extendible cardinal. Then there is a class forcing extension in which remains extendible and is not a -ground. In particular, if and then has a nontrivial ground.
The most interesting question seems to be up to when exactly the axiom of choice can fail to hold in . Since this can happen at a Mahlo cardinal, the natural next test question is whether this is possible at a weakly compact cardinal.
Question 4.2.
Suppose that is weakly compact. Must ?
References
- [FHR15] Gunter Fuchs, Joel David Hamkins, and Jonas Reitz. Set-theoretic geology. Ann. Pure Appl. Logic, 166(4):464–501, 2015.
- [Gol21] Gabriel Goldberg. Usuba’s extendible cardinal, 2021.
- [Ham03] Joel David Hamkins. Extensions with the approximation and cover properties have no new large cardinals. Fund. Math., 180(3):257–277, 2003.
- [Lav07] Richard Laver. Certain very large cardinals are not created in small forcing extensions. Annals of Pure and Applied Logic, 149(1):1–6, 2007.
- [Rei06] Jonas Reitz. The ground axiom. ProQuest LLC, Ann Arbor, MI, 2006. Thesis (Ph.D.)–City University of New York.
- [Sch18] Ralf Schindler. A note on the -mantle, 2018. URL: https://ivv5hpp.uni-muenster.de/u/rds/kappa_mantle.pdf.
- [Sch22a] Farmer Schlutzenberg. Choice principles in local mantles. Mathematical Logic Quarterly, 68(3):264–278, 2022.
- [Sch22b] Farmer Schlutzenberg. Varsovian models , 2022.
- [Sol70] Robert M. Solovay. A model of set-theory in which every set of reals is lebesgue measurable. Annals of Mathematics. Second Series, 92(1):1–56, 1970.
- [SS18] Grigor Sargsyan and Ralf Schindler. Varsovian Models I. J. Symb. Log., 83(2):496–528, 2018.
- [SSS21] Grigor Sargsyan, Ralf Schindler, and Farmer Schlutzenberg. Varsovian models ii. 2021.
- [Usu17] Toshimichi Usuba. The downward directed grounds hypothesis and very large cardinals. J. Math. Log., 17(2):1750009, 24, 2017.
- [Usu18] Toshimichi Usuba. Extendible cardinals and the mantle. ArXiv e-prints, page to appear, March 2018.
- [Woo04] W. Hugh Woodin. Recent development’s on Cantor’s Continuum Hypothesis. Proceedings of the Continuum in Philosophy and Mathematics. Carlsberg Academy, Copenhagen, 2004.
- [Woo11] W. Hugh Woodin. The continuum hypothesis, the generic-multiverse of sets, and the conjecture, page 13–42. Lecture Notes in Logic. Cambridge University Press, 2011.