16
$\begingroup$

The mathematical multiverse could be viewed as a gigantic Kripke model with models of $ZFC$ as possible worlds connected to each other via a certain accessibility relation.

The modal logic associated with this multiverse has been studied in the case that the accessibility relation is set forcing. According to this interpretation, a statement $\varphi$ in the language of set theory is considered possible if it is true in some set forcing extension and necessary if holds in all of them. For more details see:

Hamkins, Joel David; Löwe, Benedikt, The modal logic of forcing, Trans. Am. Math. Soc. 360, No. 4, 1793-1817 (2008). ZBL1139.03039.

Hamkins, Joel David, The set-theoretic multiverse, Rev. Symb. Log. 5, No. 3, 416-449 (2012). ZBL1260.03103.

However, set forcing extension is just a special case of interesting and well-behaved extensions that a model of $ZFC$ might have. If $M$ is an inner model of $N$ then we call $N$ an outer model of $M$. Recall that any model of $ZFC$ could be considered an inner model of its generic extension and so a forcing extension is a special case of an outer model. Of course, there might be outer models of a given model of $ZFC$ which don't arise as a set forcing extension of the ground. A classical example is $L\subseteq L[0^{\sharp}]$.

Now let's ease the conditions in the above interpretations of the possibility and necessity across the multiverse so that $\varphi$ is possible if it is true in some outer model and is necessary if it holds in all of them. Philosophically speaking, in such an interpretation of modalities, a statement is possible if it could be realized by expanding our world-view and is necessary if it holds no matter how we expand our universe. (Here, Plato's Allegory of the Cave might be relevant where the cave or tight universe is our ground model).

In the view of the fact that the modal logic of set forcing multiverse is fully determined by Hamkins and Löwe to be S4.2 (under certain conditions), I wonder what could be said about the modal logic of outer model multiverse.

Question. What is the modal logic of the outer multiverse; the set-theoretic multiverse equipped with the outer model relation (rather than set forcing) as the accessibility bridge between the universes?

$\endgroup$
  • $\begingroup$ How about asking the question for inner models? (I feel it is more natural to jump "into" worlds than "out of" them.) Do you already know the answer for that? I imagine it should be very similar to the logic of provability (cf. Boolos's book with that title), e.g., I think Löb's axiom holds. Now isn't there a pure modal logic way to reverse the accessibility arrows? $\endgroup$ – Gro-Tsen Jul 18 '18 at 23:50
  • 1
    $\begingroup$ @Gro-Tsen Your comment is related to the issue of the Solovay modalities for rank potentialism, namely, "true in all $V_\kappa$," interpreted in a downward sense. Solovay similarly verifies GL logic, as you noticed. Linnebo and I point out that this concept of accessbility is not potentialist, and we discuss this at length in our paper linked in my answer. $\endgroup$ – Joel David Hamkins Jul 18 '18 at 23:59
  • 2
    $\begingroup$ But to address your final comment: no, there isn't in general a way to deduce the downward logic from the upward logic, since there are Kripke models with the same upward logics, but different downward logics. In the case of forcing, for example, Benedikt Löwe and I considered this in our paper, Up and down in the generic multiverse. $\endgroup$ – Joel David Hamkins Jul 19 '18 at 0:11
21
$\begingroup$

I've noticed that recently you have asked a few questions about my work, and so let me thank you; you are kind to take an interest.

This particular question can be seen as part of the subject of set-theoretic potentialism, which my co-author Øystein Linnebo and I recently investigated in our paper:

In that paper, we consider several different notions of set-theoretic accessibility, as below, from forcing accessibility to Grothendieck-Zermelo potentialism to rank extensions or transitive extensions or submodel potentialism and others.

Set-theoretic potentialism

In each case, for each concept of accessibility we determine the corresponding modal logic of that concept of potentialism. In other related work, W. Hugh Woodin and I recently looked at the case of top-extensional set-theoretic potentialism, proving that the modal logic is S4.

(You may also be interested in my more philosophical remarks on this topic at the end of my paper, The modal logic of arithmetic potentialism and the universal algorithm.)

Nevertheless, despite all that, I am very sorry to say that none of these cases are exactly the case you asked about, which is outer-model accessibility. Outer-model potentialism is certainly a natural case of potentialism, and so let me try to tell you what I know about it. Like forcing potentialism, this would be a case of width potentialism and height actualism, since outer models increase only the width of the universe and not the height.

First, let us fix a countable model of ZFC plus V=L, say, and consider it in the context of all its outer models. Since we can force so as to destroy any stationary set in this model, while preserving others, we see that there is an infinite family of independent buttons, "the $n^{th}$ stationary set in the $L$-least partition of $\omega_1^L$ is no longer stationary." This can be made true in an outer model (by forcing) and once true, remains true in all further outer models; and the statements can be controlled independently. And since we also have a family of independent switches arising from the GCH patterns, it follows by the main modal logic analysis (as in Structural connections...), it follows that the modal logic of outer-models is contained within S4.2. And it certainly contains S4, because it is reflexive and transitive.

So the answer to your question this a modal logic between S4 and S4.2.

I don't actually know which side it will end up on, or if it will end up strictly between, and I think this is a good question.

If you hope to prove that the model logic is S4.2, then usually one does this by proving an directedness or amalgamation theorem. The problem here, however, is that we already know that outer model possibility is not directed, since you can move from a model to outer models in incompatible ways that cannot be amalgamated (this is due to Mostowski). So that avenue of showing (.2) is valid is closed off. I don't know if (.2) is valid for this notion of possibility or not, but I am inclined against it. I think there will be fundamentally incompatible possibily necessary statements, which is to say, railway switches, and this will be incompatible with S4.2.

If you hope to prove that only S4 is valid, then you could follow some of the recent work on the universal algorithm and universal finite sets. The general consequence of the existence of these finite sequences with the universal extension property is that they cause the existence of railyard labelings, which then cause the modal logic to be contained in S4. I don't know if there is any universal finite sequence phenomenon for outer models, and this also is an interesting question.

So I believe that the exact modal logic of outer-model potentialism is an open question.

$\endgroup$
  • 3
    $\begingroup$ (+1) Nice answer! Thank you, Joel! Regarding your first paragraph, let me add that I really like the type of mathematics that you conduct and I personally try to adopt such a style in my own research. Most of your papers hover around a technically rich and philosophically deep mathematical idea. They provide good answers to two fundamental questions that every piece of research faces: Why (i.e. philosophy of the work) and how (i.e. technicality). Also, you are quite open to new ideas from other researchers and disciplines which itself encourages people to follow your works closely. $\endgroup$ – Morteza Azad Jul 19 '18 at 11:54

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.