The classification of countable models of set theory

John Clemens, Samuel Coskey, Samuel Dworetzky

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 compl…