Simple groups and the number of countable models
Predrag Tanovi\'c

TL;DR
This paper investigates the upper bounds of Lascar rank in superstable theories with few models, linking properties of simple groups definable in the theory to model count limitations.
Contribution
It establishes that under certain conditions on generic types of simple groups, the Lascar rank is bounded above by , refining understanding of model complexity in superstable theories.
Findings
Lascar rank is bounded by in certain superstable theories.
Generic types of simple groups influence the model count.
Conditions on non-isolation of types are crucial for the bound.
Abstract
Let be a complete, superstable theory with fewer than countable models. Assuming that generic types of infinite, simple groups definable in are sufficiently non-isolated we prove that is the strict upper bound for the Lascar rank of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
