Pith. sign in

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

arxiv 2101.12194 v3 pith:JSSWWFHQ submitted 2021-01-28 math.LO

classification math.LO
keywords traceequivalencemathcalmathrmnotionweaktheoriesclose
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Set-defined graph classes: $\chi$-boundedness meets tropical algebra

    cs.DM 2026-07 accept novelty 8.0 of 10

    Full set-defined classes are polynomially χ-bounded iff they avoid high-chromatic shift graphs, decidable via tropical feasibility dual to mean-payoff games.

  2. Taking model-complete cores

    math.LO 2025-12 conditional novelty 8.0 of 10

    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.

Pith tools