The classification of countable models of set theory
J Clemens, S Coskey…�- Mathematical Logic�…, 2020 - Wiley Online Library
J Clemens, S Coskey, S Dworetzky
Mathematical Logic Quarterly, 2020•Wiley Online LibraryWe 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.
(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.
Abstract
We study the complexity of the classification problem for countable models of set theory (). We prove that the classification of arbitrary countable models of 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 .
Wiley Online Library