REVIEW 2 cited by
Notes on trace equivalence
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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 $\mathrm{NIP}$ theories. We describe a close connection to indiscernible collapse. We also show that if $Q$ is a divisible subgroup of $(\mathbb{R};+)$ and $\mathcal{Q}$ is a dp-rank one expansion of $(Q;+,<)$ then exactly one of the following holds: $\mathrm{Th}(\mathcal{Q})$ trace defines $\mathrm{RCF}$ or $\mathcal{Q}$ is trace equivalent to a reduct of an ordered vector space.
Forward citations
Cited by 2 Pith papers
-
Set-defined graph classes: $\chi$-boundedness meets tropical algebra
Full set-defined classes are polynomially χ-bounded iff they avoid high-chromatic shift graphs, decidable via tropical feasibility dual to mean-payoff games.
-
Taking model-complete cores
Core companions preserve stability, NIP, simplicity, and NSOP_k, but the classes of structures interpretable over (N;=) and (Q;<) are not closed under taking core companions.
Discussion (0). Sign in to comment.