The universal finite set
Abstract
We define a certain finite set in set theory and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any desired larger finite set in top-extensions of that universe. Specifically, ZFC proves the set is finite; the definition has complexity , so that any affirmative instance of it is verified in any sufficiently large rank-initial segment of the universe ; the set is empty in any transitive model and others; and if defines the set in some countable model of ZFC and for some finite set in , then there is a top-extension of to a model in which defines the new set . Thus, the set shows that no model of set theory can realize a maximal theory with its natural number parameters, although this is possible without parameters. Using the universal finite set, we prove that the validities of top-extensional set-theoretic potentialism, the modal principles valid in the Kripke model of all countable models of set theory, each accessing its top-extensions, are precisely the assertions of S4. Furthermore, if ZFC is consistent, then there are models of ZFC realizing the top-extensional maximality principle.
Keywords
Cite
@article{arxiv.1711.07952,
title = {The universal finite set},
author = {Joel David Hamkins and W. Hugh Woodin},
journal= {arXiv preprint arXiv:1711.07952},
year = {2018}
}
Comments
16 pages. Commentary can be made at http://jdh.hamkins.org/the-universal-finite-set. Version 2 makes minor changes, including a footnote concerning the history of the universal algorithm and additional references