Open Access
2007 The Borel Complexity of Isomorphism for Theories with Many Types
David Marker
Notre Dame J. Formal Logic 48(1): 93-97 (2007). DOI: 10.1305/ndjfl/1172787547
Abstract

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.

Copyright © 2007 University of Notre Dame
David Marker "The Borel Complexity of Isomorphism for Theories with Many Types," Notre Dame Journal of Formal Logic 48(1), 93-97, (2007). https://doi.org/10.1305/ndjfl/1172787547
Published: 2007
Vol.48 • No. 1 • 2007
Back to Top