The classification of countable models of set theory

被引:1
|
作者
Clemens, John [1 ]
Coskey, Samuel [1 ]
Dworetzky, Samuel [2 ]
机构
[1] Boise State Univ, Dept Math, 1910 Univ Dr, Boise, ID 83725 USA
[2] 125 W Tazewell St, Norfolk, VA 23510 USA
关键词
D O I
10.1002/malq.201900008
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models ofZFCis 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 ofZFC.
引用
收藏
页码:182 / 189
页数:8
相关论文
共 50 条