$[0,n]\cup \{\omega\}$ is a spectrum of a non-disintegrated flat strongly minimal model complete theory in a language with finite signature

Omer Mermelstein; Uri Andrews

REVIEW 2 major objections 1 minor 18 references

$[0,n]\cup \{\omega\}$ is a spectrum of a non-disintegrated flat strongly minimal model complete theory in a language with finite signature

T0 review · 2 major / 1 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A strongly minimal, flat, non-disintegrated, model complete theory in a finite signature has spectrum of recursive models exactly $[0,n]\cup\{\omega\}$.

desk verdict Genuinely new spectrum and a genuinely useful tool, but the proof of the upper bound in Lemma 6.1 has a load-bearing gap that looks real and needs fixing. read the letter →

arxiv 1908.09387 v2 pith:6UDUG4VP submitted 2019-08-25 math.LO

Uri Andrews , Omer Mermelstein This is my paper · ORCID

classification math.LO MSC 03C5703D4703C30

keywords spectrumofrecursivemodelscomputableflatnessHrushovskiconstructionstronglyminimaltheorymodelcompletenessfinitesignaturenon-disintegratedgeometry

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper proves that for every natural number $n$ there is a strongly minimal theory—flat, non-disintegrated, model complete, and expressed in a finite signature—whose recursively presentable models are exactly the models of dimensions $0$ through $n$ together with the saturated model of dimension $\omega$. This adds the set $[0,n]\cup\{\omega\}$ to the known spectra of recursive models of strongly minimal theories. The result matters because the three prototypical geometric cases (disintegrated, modular, and field-like theories) admit only a few spectra, while this flat theory exhibits a finer mixture: some positive-dimensional models are recursive and others are not. The construction combines an amalgamation construction with a coding of an r.e. set into the theory, and introduces 'unblockable' extensions to guarantee that certain algebraic extensions occur as often as the amalgamation class permits.

What carries the argument

The central object is an amalgamation class $C^\zeta_\mu$ built from a predimension $\delta(A)=|A|-\#R(A)$, where $\#R(A)$ counts occurrences of relations up to permutation, and a function $\mu(A,B,m)$ giving the maximum number of disjoint minimally simply algebraic extensions of the form $B$ over $A$ allowed over a base $A$. The argument is carried by a new supply of '3-unblockable' extensions, namely generalized ternary paths in which every added vertex lies on at most three edges; such an extension is guaranteed to realize its $\mu$-maximal number of copies over any base whatsoever, exactly the property needed to make the coding robust. A second ingredient is a dimension-dropping extension that lets the construction remove an unwanted relation from a tuple while keeping the predimension of every subset fixed, which is what allows the recursive models of dimension at most $n$ to delete the relations $R_i$ that do not belong to the true language.

What would settle it

Run the diagonalization of Section 6 for a fixed $n$ and produce a computable atomic diagram of a model of $T$ with an independent tuple of size $n+1$ whose algebraic closure is not the whole model; such a recursive model of dimension in $[n+1,\omega)$ would immediately falsify the equality $\mathrm{SRM}(T)=[0,n]\cup\{\omega\}$. More narrowly, exhibit a stage in the infinite outcome of Lemma 6.1 at which an obstruction $Y$ with $\delta(Y)=|\bar b_i|$ is removed after the relation $R_i$ has been added, since that would break the key claim that $c \notin \mathrm{acl}(\bar b_i)$.

Watch

Extended reading notes

Core claim

The central claim, proved as Theorem 6.2, is that for any $n \in \omega$ the theory $T$ built in Section 4 is strongly minimal, flat, non-disintegrated, and model complete in the finite signature $\{R\}$, and that its Spectrum of Recursive Models is exactly $[0,n]\cup\{\omega\}$. To get the positive inclusion, the paper constructs a recursive presentation of the saturated model and, uniformly, recursive copies of the models of dimension at most $n$ as algebraic closures of independent tuples. To rule out intermediate dimensions, it enumerates a set $S_1$ so that any purported recursive model with an independent tuple of size larger than $n$ either fails to satisfy $T$ or contains an element outside the algebraic closure of that tuple, hence the tuple is not a basis. The language is first built with infinitely many relations $R_i$, and the final theory is the reduct to the single ternary relation $R$; the function $\mu$ is chosen so that each $R_i$ is both existentially and universally definable in the reduct, which is what preserves model completeness.

Load-bearing premise

The proof that no model of intermediate dimension can have a recursive presentation rests on the claim that in the infinite outcome of the diagonalization, a set $Y$ that witnesses $c \in \mathrm{acl}(\bar b_i)$ together with the relation $R_i(\bar b, c)$ forms an obstruction that is never removed; if that obstruction could in fact be removed, intermediate spectra might survive.

Editorial extensions

If this is right

The set $[0,n]\cup\{\omega\}$ becomes a known spectrum of a strongly minimal theory, and the first such example that is at once flat, non-disintegrated, model complete, and in a finite signature.
For each $n$, the same construction yields a distinct theory with this spectrum, so the method produces infinitely many new spectra of recursive models.
The unblockable-extension technique provides a reusable tool for combining recursion-theoretic requirements with amalgamation constructions, since it removes the need for fragile special-case arguments about when a tuple has maximal realizations.
The results show that flatness escapes the trichotomy dichotomy: unlike disintegrated, modular, or field-like finite-signature theories, a flat finite-signature theory can have some but not all positive-dimensional models recursive.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

One might try to generalize the coding so that arbitrary finite sets replace the initial interval $[0,n]$, or so that the excluded block is not contiguous, by varying how the r.e. set $S_1$ is represented in the $\mu$ function.
Because $T$ is model complete, the relative computability of its models may be sharper than the general $\Sigma^0_4$ bound; one could study the Turing degrees that compute each model and ask whether the gap $[n+1,\omega)$ persists at other degrees.
The unblockable-extension construction suggests a testable local criterion for when a minimally simply algebraic type is guaranteed maximal multiplicity, which could be applied to higher-arity relations or to other amalgamation classes.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

The new spectrum [0,n]∪{ω} is real news, and the unblockable-extension technique is the best part of the paper. Those extensions are a clean solution to a known obstruction in Hrushovski-plus-recursion constructions, and the lower-bound construction (Section 5) is detailed and credible. If the paper did only that, it would still be worth reading.

The problem is the other half. Lemma 6.1 is supposed to kill all recursive models of intermediate dimension, and its infinite-outcome argument rests on the claim that an algebraic witness Y for c ∈ acl(b_i) becomes an obstruction that is never removed. Under the paper's own definitions, that claim fails. Once a new number enters S[i]_1, R_i is called suspicious, so L_t excludes R_i. If Y witnesses algebraicity in the true theory, then δ_{\hat L}(Y) = |b_i|, and because all relations in Y are either R, R_i, or genuine \hat L-relations, δ_t(Y) = δ_{\hat L}(Y) = |b_i| as soon as R_i is excluded. The removal condition is δ_t(Y) ≥ |b_i|, so Y is removed immediately. The proof never shows that some non-suspicious relation must occur in Y, and the Ω-extensions are R-only, so the stress-test's scenario — an R-only algebraic set plus the dynamic R_i — is exactly what the construction allows. The infinite outcome then carries no contradiction: c stays algebraic, and a recursive model of dimension n+1 can survive.

The reader's conditional acceptance was generous. I think this is not a minor gap in presentation; the diagonalization's key mechanism is doing the opposite of what the proof claims. A fix might exist — for example, redefining removal so that a newly suspicious relation still counts against the obstruction for some window, or using a different diagonalization — but it is not in the text. The lower bound and the unblockable extensions stand on their own; the claimed equality SRM(T) = [0,n]∪{ω} is not established.

Who should read it: people working on recursive spectra of strongly minimal theories will want the unblockable extension tool, and the recursive construction of the positive spectrum is a solid model for future work. But citing the main theorem now would be premature.

Recommendation: send to peer review, but with a clear instruction that Lemma 6.1 is the make-or-break point. The referee should demand either a corrected diagonalization or a formalized argument for the never-removed claim. As written, it is not ready for acceptance.

Referee Report

2 major / 1 minor

Summary. The paper aims to construct, for each finite n, a strongly minimal, flat, non-disintegrated, model complete theory in a finite signature whose spectrum of recursive models is exactly [0,n] ∪ {ω}. The construction uses a Hrushovski amalgamation class with an infinite auxiliary language, a dimension-reducing amalgamation lemma, and a family of 'unblockable' extensions that are claimed to be guaranteed to realize the maximal number of extensions over any base. A recursive saturated model and recursive models of dimensions at most n are built in Section 5, and Section 6 presents a diagonalization intended to rule out recursive models of intermediate finite dimension by enumerating a set S1 so that any candidate model with a purported basis of size k > n is either not a model or has an element algebraic over the basis that the strategy makes non-algebraic. The main theorem (Theorem 6.2) asserts that SRM(T) = [0,n] ∪ {ω}.

Significance. If the proof were correct, the paper would add [0,n] ∪ {ω} to the list of known spectra of recursive models of strongly minimal theories, and it would do so in the technically demanding setting of flat, model complete theories in finite signatures. The paper also introduces a useful technical tool: the notion of k-unblockable extensions, which are shown to have maximal realizations over arbitrary bases in the amalgamation class. The construction in Sections 2–5 is detailed and self-contained, and the algebraic-amalgamation lemmas appear carefully argued. However, the central claim of the paper depends on the correctness of the diagonalization in Section 6. That diagonalization has a load-bearing gap: it does not correctly handle algebraic witnesses that appear only after the strategy has already begun enumerating the column S1[i]. As a result, the paper does not establish the claimed exclusion of intermediate dimensions, and the main theorem is not proven.

major comments (2)

[Section 6, Step 1 and Lemma 6.1] The infinite-outcome argument assumes that any witness Y to c ∈ acl(\bar b_i) forms an obstruction that is never removed. This is not established for witnesses that appear after the first entry into Step 1. Since B_i is only a partially enumerated recursive structure, an R-only witness Y with δ_{\hat L}(Y) = |\bar b_i| may first become visible only after the strategy has already passed through Step 2 and R_i has been declared suspicious. In that case R_i is excluded from L_t, so δ_t(Y) = |Y| − #_R(Y) = δ_{\hat L}(Y) = |\bar b_i|, and the strategy's own removal rule discards the obstruction (or, if the obstruction set is not redefined on later visits, Y is never added to it). Nothing in the construction forces all algebraic witnesses to be present at the first visit to Step 1. Moreover, the fact that R_i(\bar b c) is witnessed by Ω-extensions using only R shows that a delayed R-only algebraic witness is compatible with the strategy's dynamic relation. Thus the strategy can run through Step 2 infinitely often while B_i is a recursive model of T with basis \bar b_i and c ∈ acl(\bar b_i), so the claimed exclusion of SRM(T) ∩ [n+1, ω) does not follow. The proof's 'never removed' claim is correct only for witnesses already present when R_i is not yet suspicious; that special case does not cover the general situation.
[Lemma 6.1] The step 'from some stage onward this Y forms an obstruction that is never removed' conflates the time at which Y exists with the time at which the set of obstructions is defined. If the obstruction set is defined only on the first entry into Step 1, a later-appearing Y is never considered. If the obstruction set is redefined on each entry, then by that later time R_i is already suspicious, and for an R-only Y we have δ_t(Y) = |\bar b_i|, so Y is immediately removed. Either reading breaks the contradiction with the infinite outcome. This is not a presentation issue but a load-bearing gap in the diagonalization that is essential to Theorem 6.2.

minor comments (1)

[Section 6, Step 1] The symbol δ is used for the initial obstruction condition without an explicit definition of which relations are counted at that moment, while δ_t is defined separately with a subscript; the relation between the two should be clarified.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the construction is self-contained; the only self-citations are to prior amalgamation technology and do not smuggle in the target spectrum.

full rationale

The paper builds a strongly minimal theory T_{S1} parameterized by an r.e. set S1, then in Section 6 chooses S1 by a priority diagonalization to kill every candidate recursive model of dimension in [n+1,omega). This is an existence construction, not a circular one: the theorem statement SRM(T)=[0,n] union {omega} is not used as an input. The definitional equivalence in Lemma 4.3 (R_i(x) iff exists^{n+6} y Omega_{<i,j0>}(x,y)) is deliberately engineered through the choice of mu, but it is a lemma about the constructed theory, not a hidden restatement of the spectrum result. The self-citations ([And11a], [And11b], [And10], [AM14]) are used as context or for the standard Hrushovski amalgamation lemma (Lemma 2.13), which is attributed to Hrushovski's Lemma 3; the full proof in the first author's thesis is independent supporting material, not the target claim. The dynamic 'obstruction never removed' argument in Lemma 6.1 is the fragile point, but any weakness there is a correctness risk, not a circularity: the obstruction definition and the priority construction do not assume the conclusion. Overall, the derivation chain is self-contained with respect to the claimed spectrum; no equation or parameter is fitted to the target result.

Assumptions & free parameters 1 free parameters · 4 assumptions · 1 invented entities

The construction is built on the standard Hrushovski amalgamation framework, importing the strong amalgamation lemma and flatness lemma from earlier published work. The genuinely new content is the family of unblockable extensions and the priority construction; the only hand-chosen numerical inputs are the µ allowances (|A|+4/|A|+3), which are fixed constants of the construction rather than parameters fitted to observed data.

free parameters (1)

µ allowance values (|A|+4 vs |A|+3) = |A|+4 for allowed extensions; |A|+3 otherwise
The two base values in the definition of µ (Section 4, Definition 4.1) are chosen by hand to make the counting of extensions distinguish tuples with and without a relation R_i: n+6 = |A|+4 vs n+5 = |A|+3. The proof relies on this difference (Lemma 4.4, Lemma 5.3).

assumptions (4)

standard math ZFC set theory
The entire construction is carried out in ordinary mathematics.
standard math Baldwin-Lachlan characterization of ℵ1-categorical theories (cited [BL71])
Used in the introduction to define spectra and in the proof that SRM(T) is well-defined via an elementary chain.
standard math Hrushovski's strong amalgamation lemma (Lemma 3 of [Hru93], reproduced as Lemma 2.13 via [And10])
Used as the foundation of the amalgamation class Cζμ (Lemma 2.13, Lemma 2.14, Lemma 2.15).
standard math Hrushovski's flatness lemma for hypergraphs (Lemma 15 of [Hru93])
Invoked in Corollary 2.24 to show flatness.

invented entities (1)

unblockable extensions (X_{k,l} ⊆ Y_{k,l}) independent evidence
purpose: A family of minimally simply algebraic extensions that are guaranteed, for any base in the amalgamation class, to realize the maximal allowable number of disjoint extensions, which is what makes the coding of relation symbols R_i by extension counts work (Sections 3.2, Lemma 4.3).
The paper proves their existence constructively (Corollary 3.18 via generalized paths P_k, H_k, L_k and the D_t hypergraphs) inside the amalgamation class, so they are new objects whose properties are established within the paper.

how reviews work

0 comments

Cite this review

Pith. "Pith review of $[0,n]\cup \{\omega\}$ is a spectrum of a non-disintegrated flat strongly minimal model complete theory in a language with finite signature." pith.science (2026). https://pith.science/paper/6UDUG4VP

@misc{pith2026190809387,
  author       = {Pith},
  title        = {Pith review of: $[0,n]\cup \\omega\$ is a spectrum of a non-disintegrated flat strongly minimal model complete theory in a language with finite signature},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/6UDUG4VP}},
  note         = {Machine review of arXiv:1908.09387}
}

read the original abstract

We build a new spectrum of recursive models (SRM(T)) of a strongly minimal theory. This theory is non-disintegrated, flat, model complete, and in a language with a finite signature.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

18 extracted references · 17 canonical work pages

[1]

Uri Andrews and Julia F. Knight. Strongly minimal theories with recursive models. J. Eur. Math. Soc. (JEMS) , 20(7):1561--1594, 2018

work page 2018
[2]

Building models of strongly minimal theories

Uri Andrews, Steffen Lempp, and Noah Schweber. Building models of strongly minimal theories. Submitted

work page
[3]

Recursive spectra of strongly minimal theories satisfying the Z ilber trichotomy

Uri Andrews and Alice Medvedev. Recursive spectra of strongly minimal theories satisfying the Z ilber trichotomy. Trans. Amer. Math. Soc. , 366(5):2393--2417, 2014

work page 2014
[4]

Amalgamation constructions and recursive model theory

Uri Andrews. Amalgamation constructions and recursive model theory . PhD thesis, University of California, Berkeley, 2010

work page 2010
[5]

New spectra of strongly minimal theories in finite languages

Uri Andrews. New spectra of strongly minimal theories in finite languages. Ann. Pure Appl. Logic , 162(5):367--372, 2011

work page 2011
[6]

A new spectrum of recursive models using an amalgamation construction

Uri Andrews. A new spectrum of recursive models using an amalgamation construction. J. Symbolic Logic , 76(3):883--896, 2011

work page 2011
[7]

J. T. Baldwin and A. H. Lachlan. On strongly minimal sets. J. Symbolic Logic , 36:79--96, 1971

work page 1971
[8]

Goncharov, Valentina S

Sergey S. Goncharov, Valentina S. Harizanov, Michael C. Laskowski, Steffen Lempp, and Charles F. D. McCoy. Trivial, strongly minimal theories are model complete after naming constants. Proc. Amer. Math. Soc. , 131(12):3901--3912, 2003

work page 2003

Show all 18 references

[9]

S. S. Gon c arov. Constructive models of _ 1 -categorical theories. Mat. Zametki , 23(6):885--888, 1978

1978
[10]

Hirschfeldt, Bakhadyr Khoussainov, and Pavel Semukhin

Denis R. Hirschfeldt, Bakhadyr Khoussainov, and Pavel Semukhin. An uncountably categorical theory whose only computably presentable model is saturated. Notre Dame J. Formal Logic , 47(1):63--71, 2006

2006
[11]

Constructive models of uncountably categorical theories

Bernhard Herwig, Steffen Lempp, and Martin Ziegler. Constructive models of uncountably categorical theories. Proc. Amer. Math. Soc. , 127(12):3711--3719, 1999

1999
[12]

Model theory , volume 42 of Encyclopedia of Mathematics and its Applications

Wilfrid Hodges. Model theory , volume 42 of Encyclopedia of Mathematics and its Applications . Cambridge University Press, Cambridge, 1993

1993
[13]

A new strongly minimal set

Ehud Hrushovski. A new strongly minimal set. Ann. Pure Appl. Logic , 62(2):147--166, 1993. Stability in model theory, III (Trento, 1991)

1993
[14]

Khoussainov, Michael C

Bakhadyr M. Khoussainov, Michael C. Laskowski, Steffen Lempp, and Reed Solomon. On the computability-theoretic complexity of trivial, strongly minimal models. Proc. Amer. Math. Soc. , 135(11):3711--3721, 2007

2007
[15]

Bakhadyr Khoussainov, Andre Nies, and Richard A. Shore. Computable models of theories with few models. Notre Dame J. Formal Logic , 38(2):165--178, 1997

1997
[16]

Applications of K olmogorov complexity to computable model theory

Bakhadyr Khoussainov, Pavel Semukhin, and Frank Stephan. Applications of K olmogorov complexity to computable model theory. J. Symbolic Logic , 72(3):1041--1054, 2007

2007
[17]

K. Z . Kuda bergenov. Constructivizable models of undecidable theories. Sibirsk. Mat. Zh. , 21(5):155--158, 192, 1980

1980
[18]

A new spectrum of recursive models

Andr\' e Nies. A new spectrum of recursive models. Notre Dame J. Formal Logic , 40(3):307--314, 1999

1999

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.

[1] [1]

Uri Andrews and Julia F. Knight. Strongly minimal theories with recursive models. J. Eur. Math. Soc. (JEMS) , 20(7):1561--1594, 2018

work page 2018

[2] [2]

Building models of strongly minimal theories

Uri Andrews, Steffen Lempp, and Noah Schweber. Building models of strongly minimal theories. Submitted

work page

[3] [3]

Recursive spectra of strongly minimal theories satisfying the Z ilber trichotomy

Uri Andrews and Alice Medvedev. Recursive spectra of strongly minimal theories satisfying the Z ilber trichotomy. Trans. Amer. Math. Soc. , 366(5):2393--2417, 2014

work page 2014

[4] [4]

Amalgamation constructions and recursive model theory

Uri Andrews. Amalgamation constructions and recursive model theory . PhD thesis, University of California, Berkeley, 2010

work page 2010

[5] [5]

New spectra of strongly minimal theories in finite languages

Uri Andrews. New spectra of strongly minimal theories in finite languages. Ann. Pure Appl. Logic , 162(5):367--372, 2011

work page 2011

[6] [6]

A new spectrum of recursive models using an amalgamation construction

Uri Andrews. A new spectrum of recursive models using an amalgamation construction. J. Symbolic Logic , 76(3):883--896, 2011

work page 2011

[7] [7]

J. T. Baldwin and A. H. Lachlan. On strongly minimal sets. J. Symbolic Logic , 36:79--96, 1971

work page 1971

[8] [8]

Goncharov, Valentina S

Sergey S. Goncharov, Valentina S. Harizanov, Michael C. Laskowski, Steffen Lempp, and Charles F. D. McCoy. Trivial, strongly minimal theories are model complete after naming constants. Proc. Amer. Math. Soc. , 131(12):3901--3912, 2003

work page 2003