4 citations · 12 across the 9 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.LO2017★ 1 cited
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…
math.LO2017★ 2 cited
On the classification of vertex-transitive structures
John Clemens, Samuel Coskey, Stephanie Potter
We consider the classification problem for several classes of countable structures which are "vertex-transitive", meaning that the automorphism group acts transitively on the eleme…