Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
143 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Borel completeness of some aleph_0 stable theories (1211.0558v3)

Published 2 Nov 2012 in math.LO

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

We haven't generated a summary for this paper yet.