Most(?) Theories Have Borel Complete Reducts

Journal of Symbolic Logic 88 (1):418-426 (2023)
  Copy   BIBTEX

Abstract

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete one-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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,865

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

A complicated ω-stable depth 2 theory.Martin Koerwien - 2011 - Journal of Symbolic Logic 76 (1):47 - 65.
An Old Friend Revisited: Countable Models of ω-Stable Theories.Michael C. Laskowski - 2007 - Notre Dame Journal of Formal Logic 48 (1):133-141.
Comparing Borel Reducibility and Depth of an ω-Stable Theory.Martin Koerwien - 2009 - Notre Dame Journal of Formal Logic 50 (4):365-380.
The Borel Complexity of Isomorphism for Theories with Many Types.David Marker - 2007 - Notre Dame Journal of Formal Logic 48 (1):93-97.
Borel structures and borel theories.Greg Hjorth & André Nies - 2011 - Journal of Symbolic Logic 76 (2):461 - 476.
On Unsuperstable Theories in Gdst.Miguel Moreno - 2024 - Journal of Symbolic Logic 89 (4):1720-1746.

Analytics

Added to PP
2022-08-26

Downloads
9 (#1,521,725)

6 months
2 (#1,686,184)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references