Exact saturation in pseudo-elementary classes for simple and stable theories release_lkdge53rkzf6ni34tthi4mzoca

by Itay Kaplan, Nicholas Ramsey, Saharon Shelah

Released as a article .

2020  

Abstract

We study PC-exact saturation for stable and simple theories. Among other results, we show that PC-exact saturation characterizes the stability cardinals of size at least continuum of a countable stable theory and, additionally, that simple unstable theories have PC-exact saturation at singular cardinals, satisfying mild set-theoretic hypotheses, which had previously been open even for the random graph. We characterize supersimplicity of countable theories in terms of having PC-exact saturation at singular cardinals of countable cofinality. We also consider the local analogue of PC-exact saturation, showing that local PC-exact saturation for singular cardinals of countable cofinality characterizes supershort theories.
In text/plain format

Archived Files and Locations

application/pdf  368.9 kB
file_67x3lnchtbca7oc2jka3mua3cm
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2020-09-17
Version   v1
Language   en ?
arXiv  2009.08365v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 6955581f-c67d-4262-9730-3f21f642a997
API URL: JSON