Bi-invariant types, reliably invariant types, and the comb tree property
James E. Hanson

TL;DR
This paper explores special classes of invariant types and their connection to model-theoretic tree properties, establishing new equivalences and characterizations, especially relating to the comb and antichain tree properties.
Contribution
It introduces and analyzes bi-invariant, reliably invariant, and strongly bi-invariant types, linking them to tree properties and extending existing results in model theory.
Findings
The comb tree property is equivalent to the failure of Kim's lemma for bi-invariant types.
Every type over an invariance base extends to a reliably invariant type.
NATP theories satisfy Kim's lemma for strongly bi-invariant types and a form of dual local character.
Abstract
We introduce and examine some special classes of invariant typesbi-invariant, strongly bi-invariant, extendibly invariant, and reliably invariant typesand show that they are related to certain model-theoretic tree properties. We show that the comb tree property (recently introduced by Mutchnik) is equivalent to the failure of Kim's lemma for bi-invariant types and is implied by the failure of Kim's lemma for reliably invariant types over invariance bases. We show that every type over an invariance base extends to a reliably invariant typegeneralizing an unpublished result of Kruckman and Ramseyand use this to show that, under a reasonable definition of Kim-dividing, Kim-forking coincides with Kim-dividing over invariance bases in theories without the comb tree property. Assuming a measurable cardinal, we characterize…
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.
Taxonomy
TopicsAdvanced Topology and Set Theory · Neurological and metabolic disorders
