The Borel Complexity of Isomorphism for Theories with Many Types

Notre Dame Journal of Formal Logic 48 (1):93-97 (2007)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,774

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Isomorphism of Homogeneous Structures.John D. Clemens - 2009 - Notre Dame Journal of Formal Logic 50 (1):1-22.
Comparing Borel Reducibility and Depth of an ω-Stable Theory.Martin Koerwien - 2009 - Notre Dame Journal of Formal Logic 50 (4):365-380.
Isomorphism of Locally Compact Polish Metric Structures.Maciej Malicki - 2024 - Journal of Symbolic Logic 89 (2):646-664.
Popa superrigidity and countable Borel equivalence relations.Simon Thomas - 2009 - Annals of Pure and Applied Logic 158 (3):175-189.

Analytics

Added to PP
2010-08-24

Downloads
23 (#160,613)

6 months
4 (#1,635,958)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Comparing Borel Reducibility and Depth of an ω-Stable Theory.Martin Koerwien - 2009 - Notre Dame Journal of Formal Logic 50 (4):365-380.
Introduction to the Special Issue on Vaught's Conjecture.Peter Cholak - 2007 - Notre Dame Journal of Formal Logic 48 (1):1-2.

Add more citations

References found in this work

Models of arithmetic and closed ideals.Julia Knight & Mark Nadel - 1982 - Journal of Symbolic Logic 47 (4):833-840.
Expansions of models and Turing degrees.Julia Knight & Mark Nadel - 1982 - Journal of Symbolic Logic 47 (3):587-604.

Add more references