arXiv Analytics

Sign in

arXiv:1707.04660 [math.LO]AbstractReferencesReviewsResources

The classification of countable models of set theory

John Clemens, Samuel Coskey, Samuel Dworetzky

Published 2017-07-14Version 1

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.

Related articles: Most relevant | Search more
arXiv:1510.08969 [math.LO] (Published 2015-10-30)
The complexity of the classification problem of continua
arXiv:0908.1718 [math.LO] (Published 2009-08-12, updated 2010-10-27)
The complexity of classification problems for models of arithmetic
arXiv:1501.03022 [math.LO] (Published 2015-01-13)
The classification problem for automorphisms of C*-algebras