English

Notes on trace equivalence

Logic 2022-04-07 v3

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.

Keywords

Cite

@article{arxiv.2101.12194,
  title  = {Notes on trace equivalence},
  author = {Erik Walsberg},
  journal= {arXiv preprint arXiv:2101.12194},
  year   = {2022}
}

Comments

This supersedes and replaces arxiv:1910.13504 and arxiv:2006.00137

R2 v1 2026-06-23T22:37:57.806Z