Notes on trace equivalence
Abstract
We introduce trace definability, a weak notion of interpretability, and trace equivalence, a weak notion of equivalence for first order structures and theories. In particular we get an interesting weak equivalence notion for NIP theories. We describe a close connection to indiscernible collapse. We also show that if Q is a divisible subgroup of (R;+) and Q is a dp-rank one expansion of (Q;+,<) then exactly one of the following holds: Th(Q) trace defines RCF or Q is trace equivalent to a reduct of an ordered vector space.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.