pith. sign in

arxiv: 2504.05566 · v3 · pith:RLL5NXXZnew · submitted 2025-04-07 · 🧮 math.LO

Trace definability I: preservation and characterizations

Pith reviewed 2026-05-22 21:16 UTC · model grok-4.3

classification 🧮 math.LO
keywords trace definabilitypreservationcharacterizationclassification theorymodel theoryfirst-order structuresdefinability
0
0 comments X

The pith

Trace definability is a weakening of definability under which some classification-theoretic properties are preserved and can be characterized.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces trace definability as a weak form of definability for first-order structures. It determines which classification-theoretic properties remain intact when one structure is trace definable in another. The properties that are preserved admit characterizations expressed directly in terms of trace definability. A sympathetic reader would care because the work connects preservation questions to definability conditions, giving a tool to test the robustness of model-theoretic invariants under relaxed definability.

Core claim

We introduce a notion of weak definability of first order structures, show that various classification-theoretic properties are or are not preserved under it, and that the properties which are preserved can also be characterized in terms of it.

What carries the argument

Trace definability, a weakening of ordinary definability between first-order structures.

If this is right

  • Properties preserved under trace definability admit characterizations expressed using trace definability.
  • Certain classification properties fail to be preserved, marking the limits of invariance under this weakening.
  • Trace definability supplies a single method for establishing both preservation and characterization results.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same preservation and characterization pattern may appear with other weakenings of definability in related logical settings.
  • These results could guide the search for invariants that remain stable when structures are obtained via trace definable expansions.

Load-bearing premise

The introduced notion of trace definability is a coherent and useful weakening of ordinary definability that interacts meaningfully with the classification-theoretic properties under consideration.

What would settle it

A specific classification-theoretic property that is preserved under trace definability yet lacks a characterization in terms of trace definability, or one that has such a characterization but fails to be preserved.

read the original abstract

We introduce a notion of weak definability of first order structures, show that various classification-theoretic properties are or are not preserved under it, and that the properties which are preserved can also be characterized in terms of it.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper introduces a notion of trace definability as a weakening of ordinary definability for first-order structures. It claims to establish which classification-theoretic properties are preserved (and which are not) under trace definability, and to give characterizations of the preserved properties in terms of the new notion.

Significance. If the preservation and characterization results are correct, the work would supply a new technical tool in model theory for studying controlled weakenings of definability and their interaction with classification invariants. This could be useful for distinguishing structures where full definability is too restrictive.

major comments (1)
  1. Abstract: the central claims (preservation of some properties, non-preservation of others, and characterizations) cannot be assessed because no definitions of trace definability, no statements of the relevant classification-theoretic properties, no theorems, and no proofs or counterexamples are visible in the supplied text.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their report. We address the single major comment below.

read point-by-point responses
  1. Referee: Abstract: the central claims (preservation of some properties, non-preservation of others, and characterizations) cannot be assessed because no definitions of trace definability, no statements of the relevant classification-theoretic properties, no theorems, and no proofs or counterexamples are visible in the supplied text.

    Authors: The full manuscript contains the definition of trace definability (as a weakening of ordinary definability), the specific classification-theoretic properties under consideration, the precise statements of the preservation and non-preservation theorems, the characterization theorems, and all proofs and counterexamples. The abstract was written to be concise, but we agree that it does not supply sufficient detail for the claims to be evaluated from the abstract alone. We will revise the abstract to include a brief outline of the definition, the main preservation/non-preservation results, and the characterizations. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper introduces a new definition of trace definability for first-order structures and then proves preservation and characterization theorems for various classification-theoretic properties under this notion. No fitted parameters, predictions by construction, self-citations as load-bearing premises, or ansatzes smuggled via prior work appear in the abstract or described content. The central claims are standard mathematical consequences derived from the introduced definition, making the work self-contained with independent content.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only the abstract is available; no explicit free parameters, axioms, or invented entities are stated.

pith-pipeline@v0.9.0 · 5534 in / 844 out tokens · 23081 ms · 2026-05-22T21:16:37.689757+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.