The classification of countable models of set theory [article]

John Clemens, Samuel Coskey, Samuel Dworetzky
2020 arXiv   pre-print
We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be. We then give partial results concerning the classification of countable well-founded models of ZFC.
arXiv:1707.04660v4 fatcat:sdudwk5d65ej5fevbdxpfwgv7a