Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the set-generic multiverse

Published 6 Jul 2016 in math.LO | (1607.01625v1)

Abstract: The forcing method is a powerful tool to prove the consistency of set-theoretic assertions relative to the consistency of the axioms of set theory. Laver's theorem and Bukovsk\'y's theorem assert that set-generic extensions of a given ground model constitute a quite reasonable and sufficiently general class of standard models of set-theory. In sections 2 and 3 of this note, we give a proof of Bukovsk\'y's theorem in a modern setting (for another proof of this theorem see Bukovsk\'y [4]). In section 4 we check that the multiverse of set-generic extensions can be treated as a collection of countable transitive models in a conservative extension of ZFC. The last section then deals with the problem of the existence of infinitely-many independent buttons, which arose in the modal-theoretic approach to the set-generic multiverse by J.Hamkins and B.Loewe [12].

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.