Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 50, Number 4 (2009), 365-380.
Comparing Borel Reducibility and Depth of an ω-Stable Theory
In "A proof of Vaught's conjecture for ω-stable theories," the notions of ENI-NDOP and eni-depth have been introduced, which are variants of the notions of NDOP and depth known from Shelah's classification theory. First, we show that for an ω-stable first-order complete theory, ENI-NDOP allows tree decompositions of countable models. Then we discuss the relationship between eni-depth and the complexity of the isomorphism relation for countable models of such a theory in terms of Borel reducibility as introduced by Friedman and Stanley and construct, in particular, a sequence of complete first-order ω-stable theories with increasing and cofinal eni-depth and isomorphism relations which are strictly increasing with respect to Borel reducibility.
Notre Dame J. Formal Logic, Volume 50, Number 4 (2009), 365-380.
First available in Project Euclid: 11 February 2010
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Koerwien , Martin. Comparing Borel Reducibility and Depth of an ω-Stable Theory. Notre Dame J. Formal Logic 50 (2009), no. 4, 365--380. doi:10.1215/00294527-2009-016. https://projecteuclid.org/euclid.ndjfl/1265899120