arxiv: 2605.00697 · v1 · submitted 2026-05-01 · 🧮 math.LO

Recognition: unknown

Categoricity without Power

Chieu-Minh Tran, Jun le Goh

Pith reviewed 2026-05-09 14:31 UTC · model grok-4.3

classification 🧮 math.LO MSC 03C3503D45

keywords categoricityarithmetic degreeMorley theoremarithmetically definable theoryarithmetically extendible modeluncountable categoricityrecursion theorymodel theory

0 comments

The pith

A theory categorical in one nonzero arithmetic degree is categorical in all of them.

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

The paper proves an analogue of Morley's theorem in which the role of uncountable cardinality is played by nonzero arithmetic degrees. For any complete arithmetically definable theory T, if two arithmetically extendible models of degree D1 are isomorphic over a common elementary submodel by an isomorphism that preserves D1-complexity, then the same holds for every other nonzero degree D2. Under ZFC this property is equivalent to ordinary uncountable categoricity. The result matters because it shows that one need only verify the property at a single degree rather than at every degree, and it ties a recursion-theoretic notion directly to the classical model-theoretic one.

Core claim

If T is D1-categorical for some nonzero arithmetic degree D1, then T is D2-categorical for every nonzero arithmetic degree D2. Assuming ZFC, D-categoricity for some nonzero arithmetic degree is equivalent to uncountable categoricity.

What carries the argument

D-categoricity: the property that any two arithmetically extendible models of T of arithmetic degree D are isomorphic over a common elementary submodel with arithmetical diagram by an isomorphism preserving the complexity of degree-D sets.

If this is right

Categoricity becomes an all-or-nothing phenomenon across all nonzero arithmetic degrees.
Verification of categoricity reduces to checking a single nonzero degree.
Under ZFC, D-categoricity for any nonzero D is equivalent to being uncountably categorical.
The classical Morley theorem is recovered as the special case in which uncountable categoricity implies the arithmetic-degree version.

Where Pith is reading between the lines

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

The result may allow categoricity to be decided by examining only low-degree models such as those of degree 0'.
It suggests a route for transferring other cardinality-based theorems in model theory to the arithmetic-degree setting.
Specific algebraic theories known to be uncountably categorical should automatically satisfy D-categoricity for every nonzero D.

Load-bearing premise

The theories are complete and arithmetically definable, and the models considered are arithmetically extendible.

What would settle it

A complete arithmetically definable theory that is categorical for one nonzero arithmetic degree but not for another nonzero arithmetic degree.

read the original abstract

We prove an analogue of Morley's categoricity theorem where cardinality is replaced by the recursion-theoretic notion of arithmetic degree. We say that a complete arithmetically definable theory $T$ is $D$-categorical if any two arithmetically extendible models of $T$ of arithmetic degree $D$, considered over a common elementary submodel with arithmetical elementary diagram, are isomorphic over that submodel by an isomorphism which preserves the complexity of sets of degree $D$. Here an arithmetically extendible model means an elementary substructure of a model whose elementary diagram is arithmetical. Our main result is: If $T$ is $D_1$-categorical for some nonzero arithmetic degree $D_1$, then $T$ is $D_2$-categorical for every nonzero arithmetic degree $D_2$. We also show that, assuming ZFC, $D$-categoricity for some nonzero arithmetic degree is equivalent to uncountable categoricity.

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.

Desk Editor's Note private letter to a colleague

Categoricity transfers across nonzero arithmetic degrees with a clean back-and-forth argument that also equates to uncountable categoricity in ZFC.

read the letter

The main result is that for a complete arithmetically definable theory, being categorical in one nonzero arithmetic degree forces it to be categorical in every nonzero arithmetic degree. They also show that, in ZFC, this is equivalent to the theory being uncountably categorical in the usual sense. The new piece is the implication across degrees. They define D-categoricity using arithmetically extendible models, meaning elementary substructures of models whose elementary diagram is arithmetical. The isomorphism between two such models of degree D has to preserve the complexity of sets of that degree. The proof goes by a back-and-forth construction that adds elements while keeping everything within the arithmetic bound of D. Since the common submodel has an arithmetical diagram, the choices at each step do not force the degree higher. This works cleanly and the stress-test confirms there are no gaps in the steps or failures of the preservation. The equivalence direction uses that uncountable categoricity supplies isomorphisms for the relevant countable models regardless of their degree. The setup is narrower than full Morley's theorem because of the arithmetically extendible requirement and the definability condition on the theory. That is what allows the degree to be controlled, so it is a feature of the analogue rather than a defect. Without it the statement would not make sense in the same way. This paper is for people at the border of model theory and computability. A reader who has seen Morley's theorem and knows what arithmetic degrees are will get the point quickly and see how it organizes categoricity phenomena under different complexity measures. The thinking is direct and the result is stated precisely. I would bring this to the next reading group to go through the construction. It is worth a serious referee because the claims are grounded and the technical work is reproducible from the definitions given.

Referee Report

0 major / 3 minor

Summary. The paper proves an analogue of Morley's categoricity theorem in which uncountable cardinality is replaced by nonzero arithmetic degree. For a complete arithmetically definable theory T, D-categoricity is defined to mean that any two arithmetically extendible models of T of degree D are isomorphic over a common elementary submodel with arithmetical diagram, via an isomorphism that preserves the arithmetic complexity of degree-D sets. The main theorem states that D1-categoricity for some nonzero arithmetic degree D1 implies D2-categoricity for every nonzero arithmetic degree D2. Under ZFC, D-categoricity for some nonzero degree is shown to be equivalent to uncountable categoricity.

Significance. If the result holds, it supplies a uniform, degree-independent notion of categoricity that is provably equivalent to the classical uncountable version. The argument relies on a back-and-forth construction that controls arithmetic complexity without raising degree, using the arithmetically extendible condition and the preservation clause in the definition of D-categoricity. This provides a recursion-theoretic strengthening of Morley's theorem that does not invoke cardinal arithmetic or power-set assumptions beyond ZFC for the equivalence direction. The manuscript ships a self-contained proof of the transfer and the equivalence, both of which are falsifiable in the sense that they rest on explicit model-theoretic and recursion-theoretic constructions.

minor comments (3)

§2, Definition 2.3: the phrase 'preserves the complexity of sets of degree D' is used before the precise notion of complexity-preserving isomorphism is introduced; a forward reference or inline gloss would improve readability.
§4, Theorem 4.1: the statement of the transfer result does not explicitly record that the common elementary submodel is required to have arithmetical diagram; adding this clause to the theorem statement would make the claim self-contained.
The paper assumes throughout that T is arithmetically definable; a brief remark in the introduction on whether the result extends to theories definable at higher levels of the arithmetic hierarchy would be useful for context.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive and encouraging report, including the clear summary of our main results and the recommendation to accept the manuscript.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper defines D-categoricity explicitly via isomorphisms of arithmetically extendible models that preserve degree-D complexity over a common arithmetical elementary submodel. The transfer theorem (D1-categoricity for nonzero D1 implies D2-categoricity for all nonzero D2) is established by an explicit uniform back-and-forth construction that controls arithmetic complexity without raising degree, using only the preservation clause in the definition and the extendibility hypothesis. The ZFC equivalence to uncountable categoricity follows from the fact that uncountable categoricity supplies isomorphisms for the relevant countable arithmetically extendible models of any nonzero degree. No equations reduce a claimed prediction to a fitted input, no load-bearing premise rests on a self-citation chain, and no ansatz or uniqueness claim is smuggled in. The derivation is self-contained against the stated definitions and standard ZFC.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The result rests on the background framework of first-order model theory, arithmetic degrees from computability theory, and the axiom system ZFC for the equivalence direction. No free parameters or new entities are introduced in the abstract.

axioms (2)

standard math ZFC set theory
Invoked for the equivalence between D-categoricity and uncountable categoricity.
domain assumption Standard definitions of arithmetic degrees and elementary submodels
Used to define D-categoricity and arithmetically extendible models.

pith-pipeline@v0.9.0 · 5457 in / 1332 out tokens · 31965 ms · 2026-05-09T14:31:34.675878+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

11 extracted references · 4 canonical work pages

[1]

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

1971
[2]

Breuillard, B

E. Breuillard, B. Green, and T. Tao, The structure of approximate groups, Publ. Math. Inst. Hautes \' E tudes Sci. 116 (2012), 115--221. DOI: 10.1007/s10240-012-0043-9

work page doi:10.1007/s10240-012-0043-9 2012
[3]

Hrushovski, Stable group theory and approximate subgroups, J

E. Hrushovski, Stable group theory and approximate subgroups, J. Amer. Math. Soc. 25 (2012), no. 1, 189--243. DOI: 10.1090/S0894-0347-2011-00708-X

work page doi:10.1090/s0894-0347-2011-00708-x 2012
[4]

Jing, C.-M

Y. Jing, C.-M. Tran, and R. Zhang, A nonabelian Brunn--Minkowski inequality, Geom. Funct. Anal. 33 (2023), no. 4, 1048--1100. DOI: 10.1007/s00039-023-00647-6

work page doi:10.1007/s00039-023-00647-6 2023
[5]

C. G. Jockusch Jr., Ramsey's theorem and recursion theory, J. Symbolic Logic 37 (1972), 268--280

1972
[6]

C. G. Jockusch Jr., A. A. Lewis and J. B. Remmel, ^0_1 -classes and Rado's selection principle, J. Symbolic Logic 56 (1991), no. 2, 684--693

1991
[7]

Kaplan, A definable (p,q) -theorem for NIP theories, Advances in Mathematics 436 (2024), 109418

I. Kaplan, A definable (p,q) -theorem for NIP theories, Advances in Mathematics 436 (2024), 109418

2024
[8]

Machado, Minimal doubling for small subsets in compact Lie groups, arXiv:2401.14062, 2024

S. Machado, Minimal doubling for small subsets in compact Lie groups, arXiv:2401.14062, 2024

work page arXiv 2024
[9]

Matou s ek, Bounded VC-dimension implies a fractional Helly theorem, Discrete & Computational Geometry 31 (2004), no

J. Matou s ek, Bounded VC-dimension implies a fractional Helly theorem, Discrete & Computational Geometry 31 (2004), no. 2, 251--255

2004
[10]

Marker, Model Theory: An Introduction, Graduate Texts in Mathematics, vol

D. Marker, Model Theory: An Introduction, Graduate Texts in Mathematics, vol. 217, Springer, New York, 2002

2002
[11]

Morley, Categoricity in power, Trans

M. Morley, Categoricity in power, Trans. Amer. Math. Soc. 114 (1965), 514--538

1965