Notes on trace equivalence

preprint2022arXivOpen access

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\mathrm{NIP} theories. We describe a close connection to indiscernible collapse. We also show that if QQ is a divisible subgroup of (R;+)(\mathbb{R};+) and Q\mathcal{Q} is a dp-rank one expansion of (Q;+,<)(Q;+,<) then exactly one of the following holds: Th(Q)\mathrm{Th}(\mathcal{Q}) trace defines RCF\mathrm{RCF} or Q\mathcal{Q} is trace equivalent to a reduct of an ordered vector space.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.