The Borel complexity of isomorphism for theories with many types (Q998140)

Within the broader question of which Borel equivalence relations can arise as the isomorphism relation on the countable models of a first-order theory, Hjorth and Kechris asked if the isomorphism relation can (as a Borel equivalence relation) be essentially countable but not tame. The author shows that the answer is no if the first-order theory has uncountably many types.