Papers
Topics
Authors
Recent
Search
2000 character limit reached

Borel completeness of some aleph_0 stable theories

Published 2 Nov 2012 in math.LO | (1211.0558v3)

Abstract: We study aleph_0-stable theories, and prove that if T either has eni-DOP or is eni-deep, then its class of countable models is Borel complete. We introduce the notion of lambda-Borel completeness and prove that such theories are lambda-Borel complete. Using this, we conclude that an aleph_0-stable theory has 2lambda pairwise non-L(infinity,aleph_0) equivalent models of size lambda for all infinite cardinals lambda if and only if T either has eni-DOP or is eni-deep.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.