pith. sign in

arxiv: 1607.01625 · v1 · pith:ANPVNVYInew · submitted 2016-07-06 · 🧮 math.LO

On the set-generic multiverse

classification 🧮 math.LO
keywords set-generictheorembukovskmultiverseconsistencyextensionsmodelsproof
0
0 comments X
read the original 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].

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.