During the Notre Dame workshop on Vaught's Conjecture, Hjorth and Kechris asked which Borel equivalence relations can arise as the isomorphism relation for countable models of a first-order theory. In particular, they asked if the isomorphism relation can be essentially countable but not tame. We show this is not possible if the theory has uncountably many types.
Publié le : 2007-01-14
Classification:
Borel equivalence relation,
Scott set,
S-saturated model,
03C15,
03E15
@article{1172787547,
author = {Marker, David},
title = {The Borel Complexity of Isomorphism for Theories with Many Types},
journal = {Notre Dame J. Formal Logic},
volume = {48},
number = {1},
year = {2007},
pages = { 93-97},
language = {en},
url = {http://dml.mathdoc.fr/item/1172787547}
}
Marker, David. The Borel Complexity of Isomorphism for Theories with Many Types. Notre Dame J. Formal Logic, Tome 48 (2007) no. 1, pp. 93-97. http://gdmltest.u-ga.fr/item/1172787547/