2000 character limit reached
Most(?) theories have Borel complete reducts
Published 17 Mar 2021 in math.LO | (2103.09724v2)
Abstract: We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M{eq}$ has a Borel complete reduct, and if a theory $T$ is not $\omega$-stable, then the elementary diagram of some countable model of $T$ has a Borel complete reduct.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.