
TL;DR
This paper introduces the class of tame ultraimaginaries in simple theories, explores their properties, and establishes results on their elimination and canonical base behavior.
Contribution
It defines tame ultraimaginaries and proves basic simplicity-theoretic properties, including feeble elimination and uniform canonical base results.
Findings
Feeble elimination of supersimple ultraimaginaries up to certain ranks
Introduction of tame ultraimaginaries with well-behaved properties
Uniform versions of the weak canonical base property
Abstract
We define a reasonably well-behaved class of ultraimaginaries, i.e.\ classes modulo invariant equivalence relations, called {\em tame}, and establish some basic simplicity-theoretic facts. We also show feeble elimination of supersimple ultraimaginaries: If is an ultraimaginary definable over a tuple with , then is eliminable up to rank . Finally, we prove some uniform versions of the weak canonical base property.
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 · Computability, Logic, AI Algorithms · Rings, Modules, and Algebras
