A combinatorial characterization of Kim's lemma for pairs of bi-invariant types
James E. Hanson

TL;DR
This paper characterizes when Kim's lemma fails for pairs of bi-invariant types using combinatorial configurations, linking model-theoretic properties to graph-theoretic structures and set-theoretic assumptions.
Contribution
It provides a combinatorial framework for understanding Kim's lemma failure for bi-invariant types and connects it to complex graph configurations and set-theoretic principles.
Findings
Failure of Kim's lemma characterized by combinatorial configurations
Existence of parameter families indexed by cographs implies Kim's lemma failure
Certain array configurations lead to failure of stationary local character under GCH
Abstract
We give a combinatorial consistency-inconsistency configuration that is equivalent to the failure of the following form of Kim's lemma for a given : For any set of parameters , formula , and -bi-invariant types and extending , if -divides along , then it divides along . We then give an equivalent technical variant of that is non-trivial over arbitrary invariance bases. We also show that the failure of weaker versions of entails the existence of stronger combinatorial configurations, the strongest of which can be phrased in terms of families of parameters indexed by arbitrary cographs (i.e., -free graphs). Finally, we show that if there is an array of parameters such that is consistent whenever $C \subseteq…
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.
