Set-theoretic blockchains

  • M. E. Habič, J. D. Hamkins, L. D. Klausner, J. Verner, and K. J. Williams, “Set-theoretic blockchains,” ArXiv e-prints, pp. 1-23, 2018. (under review)  
    author = {Miha E. Habi\v{c} and Joel David Hamkins and Lukas Daniel Klausner and Jonathan Verner and Kameryn J. Williams},
    title = {Set-theoretic blockchains},
    journal = {ArXiv e-prints},
    year = {2018},
    volume = {},
    number = {},
    pages = {1--23},
    month = {},
    note = {under review},
    abstract = {},
    eprint = {1808.01509},
    archivePrefix = {arXiv},
    primaryClass = {math.LO},
    keywords = {under-review},
    source = {},
    doi = {},
    url = {},

Abstract. Given a countable model of set theory, we study the structure of its generic multiverse, the collection of its forcing extensions and ground models, ordered by inclusion. Mostowski showed that any finite poset embeds into the generic multiverse while preserving the nonexistence of upper bounds. We obtain several improvements of his result, using what we call the blockchain construction to build generic objects with varying degrees of mutual genericity. The method accommodates certain infinite posets, and we can realize these embeddings via a wide variety of forcing notions, while providing control over lower bounds as well. We also give a generalization to class forcing in the context of second-order set theory, and exhibit some further structure in the generic multiverse, such as the existence of exact pairs.