Simple Homogeneous Structures and Indiscernible Sequence Invariants
John Baldwin, James Freitag, Scott Mutchnik

TL;DR
This paper explores properties of dependence in indiscernible sequences, establishing new results on nonminimality, finite rank, and Kim-forking conjectures in simple and NSOP1 theories.
Contribution
It introduces properties like $F_{ind}$ and $F_{Mb}$, proving their significance in dependence, and resolves questions about nonminimality and Kim-forking in various theories.
Findings
Nonminimality degree can be any positive integer in $ ext{DCF}_0$.
Every simple theory with quantifier elimination in finite relational language has finite rank and is one-based.
Global analogue of the simple Kim-forking conjecture holds in every $ ext{NSOP}_1$ theory.
Abstract
We introduce some properties describing dependence in indiscernible sequences: and its dual , the definable Morley property, and -resolvability. Applying these properties, we establish the following results: We show that the degree of nonminimality introduced by Freitag and Moosa, which is closely related to (equal in ), may take on any positive integer value in an -stable theory, answering a question of Freitag, Jaoui, and Moosa. Proving a conjecture of Koponen, we show that every simple theory with quantifier elimination in a finite relational language has finite rank and is one-based. The arguments closely rely on finding types with , and on -resolvability. We prove some variants of the simple Kim-forking conjecture, a generalization of the stable forking conjecture to …
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.
