REVIEW 2 major objections 1 minor
The Łoś–Tarski preservation theorem fails for the fluted fragment already at quantifier rank three.
Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →
T0 review · grok-4.5
2026-07-15 01:54 UTC pith:6Q5TCBE3
load-bearing objection Abstract-only refutation of Purdy on Łoś–Tarski for the fluted fragment; clean claim, construction not checkable here. the 2 major comments →
Failure of the Los-Tarski preservation theorem for the fluted fragment
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
There exists a fluted sentence of quantifier rank three over an equality-free vocabulary with only one binary relation symbol that is preserved under extensions but is not equivalent, even over finite structures, to any existential fluted sentence. This refutes Purdy’s claim that the Łoś–Tarski theorem holds for the fluted fragment.
What carries the argument
A concrete fluted sentence of quantifier rank three (the paper’s explicit counterexample construction) that is preserved under extensions yet fails to be equivalent over finite models to any existential fluted sentence.
Load-bearing premise
The author’s concrete sentence is simultaneously fluted of quantifier rank three, preserved under extensions, and inequivalent over finite structures to every existential fluted sentence.
What would settle it
Produce an existential fluted sentence that is equivalent over finite structures to the constructed counterexample, or show that the constructed sentence fails to be preserved under some extension.
If this is right
- Preservation under extensions does not characterise the existential fluted sentences, even when models are restricted to be finite.
- Any proof of Łoś–Tarski for full first-order logic must rely on features of variable reuse or equality that the fluted fragment lacks.
- A counterexample already exists at quantifier rank three and with a minimal equality-free signature consisting of one binary relation.
- Purdy’s claimed preservation theorem for the fluted fragment is false.
Where Pith is reading between the lines
- Similar failures of classical preservation theorems may appear in other variable-restricted fragments that forbid free rebinding of variables.
- Decision procedures or normal-form results for fluted logic cannot safely assume that extension-preserving sentences reduce to existential form.
- The finite-model non-equivalence suggests the counterexample is not an artefact of infinite models and may be checkable by small finite structures.
- One natural next check is whether adding equality or raising the quantifier-rank bound restores a restricted form of the theorem.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript claims that the Łoś–Tarski preservation theorem fails for the fluted fragment. Concretely, it asserts the existence of a fluted sentence of quantifier rank three, over an equality-free signature with a single binary relation symbol, that is preserved under extensions yet is not equivalent—even over finite structures—to any existential fluted sentence, thereby refuting Purdy’s claim that the analogous preservation theorem holds for fluted logic.
Significance. If the construction and both arguments are correct, the result is a clear, negative correction to the published literature on the model theory of the fluted fragment. Failure already at quantifier rank three in a minimal equality-free signature, and persistence of the failure over finite structures, would be a sharp and informative divergence from classical first-order behaviour. The finite-model strengthening is especially valuable: it rules out the possibility that the classical correspondence is restored once one restricts to finite models. The contribution is therefore of genuine interest to finite model theory and to the study of restricted variable-order fragments.
major comments (2)
- [Abstract] The central contribution is a pure existence claim for a single concrete sentence φ that must simultaneously be (i) fluted of quantifier rank three over one binary relation, (ii) preserved under extensions, and (iii) inequivalent over finite structures to every existential fluted sentence. Only the abstract is available for review; neither the formula nor the two supporting arguments appear in the materials under review. Properties (i)–(ii) are local and in principle checkable once φ is exhibited; property (iii) is global and requires either an exhaustive classification of existential fluted sentences up to the relevant rank or a model-theoretic invariant separating φ from that class over finite structures. Without the construction and the finite-model separation argument, the load-bearing half of the refutation of Purdy cannot be assessed.
- [Abstract] The finite-model inequivalence claim is strictly stronger than mere failure of Łoś–Tarski over arbitrary structures, and it is the half that actually refutes Purdy in the form stated. If the finite-model argument fails while the infinite-model argument succeeds, the paper would still show that classical Łoś–Tarski fails for fluted logic, but the published claim being refuted would be only partially answered. The abstract asserts both halves without supplying either argument; verification of the finite half is therefore the single most critical missing step.
minor comments (1)
- [Abstract] The abstract is clear and self-contained as a statement of the claim, but it would help readers if the vocabulary signature and the precise sense of ‘existential fluted sentence’ (prefix form vs. quantifier-free matrix in fluted order) were fixed in one sentence already in the abstract.
Circularity Check
No circularity: abstract-only counterexample claim against external standard definitions; no derivation chain to inspect.
full rationale
Only the abstract is available. It asserts existence of a concrete fluted sentence of quantifier rank three that is preserved under extensions yet inequivalent (even over finite structures) to any existential fluted sentence, thereby refuting Purdy's claim. The notions involved—Łoś–Tarski preservation, the fluted fragment, existential fluted sentences, quantifier rank, equality-free signatures—are standard external definitions, not quantities fitted or defined in terms of the claimed result. There is no parameter fitting, no self-definitional reduction, no uniqueness theorem imported from the same authors, no ansatz smuggled via self-citation, and no renaming of a known empirical pattern. Because the full construction is not present, no equation or derivation step can be exhibited that reduces the output to the input by construction. The reader's circularity score of 0 is therefore confirmed: the paper (as given) is a pure existence claim measured against independent benchmarks. Any remaining doubt concerns correctness or completeness of the unseen construction, not circularity.
Axiom & Free-Parameter Ledger
axioms (3)
- standard math Standard first-order model theory and the classical Łoś–Tarski preservation theorem
- domain assumption The definition of the fluted fragment (and of existential fluted sentences) as used by Purdy and subsequent literature
- ad hoc to paper Existence of a concrete fluted sentence of quantifier rank three over one binary relation with the claimed preservation and finite-model non-equivalence properties
read the original abstract
The classical Los-Tarski theorem characterises first-order sentences preserved under extensions as the existentially definable ones. In [6], Purdy claimed that the analogous preservation theorem holds for the fluted fragment. We refute this claim by constructing, over an equality-free vocabulary with only one binary relation symbol, a fluted sentence of quantifier rank three which is preserved under extensions but is not equivalent, even over finite structures, to any existential fluted sentence.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.