Existence of optimal ultrafilters and the fundamental complexity of simple theories

From MaRDI portal
Publication:908076

DOI10.1016/J.AIM.2015.12.009zbMATH Open1431.03048arXiv1404.2919OpenAlexW2963220768WikidataQ105488011 ScholiaQ105488011MaRDI QIDQ908076FDOQ908076


Authors: S. Shelah, M. Malliaris Edit this on Wikidata


Publication date: 2 February 2016

Published in: Advances in Mathematics (Search for Journal in Brave)

Abstract: In the first edition of Classification Theory, the second author characterized the stable theories in terms of saturation of ultrapowers. Prior to this theorem, stability had already been defined in terms of counting types, and the unstable formula theorem was known. A contribution of the ultrapower characterization was that it involved sorting out the global theory, and introducing nonforking, seminal for the development of stability theory. Prior to the present paper, there had been no such characterization of an unstable class. In the present paper, we first establish the existence of so-called optimal ultrafilters on Boolean algebras, which are to simple theories as Keisler's good ultrafilters are to all theories. Then, assuming a supercompact cardinal, we characterize the simple theories in terms of saturation of ultrapowers. To do so, we lay the groundwork for analyzing the global structure of simple theories, in ZFC, via complexity of certain amalgamation patterns. This brings into focus a fundamental complexity in simple unstable theories having no real analogue in stability.


Full work available at URL: https://arxiv.org/abs/1404.2919




Recommendations




Cites Work


Cited In (19)





This page was built for publication: Existence of optimal ultrafilters and the fundamental complexity of simple theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908076)