IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-62935-3_5.html
   My bibliography  Save this book chapter

On the Set-Generic Multiverse

In: The Hyperuniverse Project and Maximality

Author

Listed:
  • Sy-David Friedman

    (University of Vienna, Kurt Gödel Research Center for Mathematical Logic)

  • Sakaé Fuchino

    (Kobe University, Graduate School of System Informatics)

  • Hiroshi Sakai

    (Kobe University, Graduate School of System Informatics)

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ý’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 Sects. 2 and 3 of this note, we give a proof of Bukovsky’s theorem in a modern setting (for another proof of this theorem see Bukovský (Generic Extensions of Models of ZFC, a lecture note of a talk at the Novi Sad Conference in Set Theory and General Topology, 2014)). In Sect. 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 Hamkins and Loewe (Trans. Am. Math. Soc. 360(4):1793–1817, 2008).

Suggested Citation

  • Sy-David Friedman & Sakaé Fuchino & Hiroshi Sakai, 2018. "On the Set-Generic Multiverse," Springer Books, in: Carolin Antos & Sy-David Friedman & Radek Honzik & Claudio Ternullo (ed.), The Hyperuniverse Project and Maximality, pages 109-124, Springer.
    • Handle: RePEc:spr:sprchp:978-3-319-62935-3_5
    DOI: 10.1007/978-3-319-62935-3_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-319-62935-3_5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.