arxiv: 2604.14461 · v2 · submitted 2026-04-15 · 🧮 math.LO

Recognition: 1 theorem link

· Lean Theorem

A rank function for Fra\"{i}ss\'{e} classes and the rank property

Carlos L\'opez-Callejas, Jareb Navarro-Castillo

Pith reviewed 2026-05-13 07:56 UTC · model grok-4.3

classification 🧮 math.LO

keywords Fraïssé classesrank functionrank propertyfree amalgamationtournamentslinear orderscountable structuresordinal ranks

0 comments

The pith

Certain Fraïssé classes realize every countable ordinal as a value of the rank function measuring distance from universality.

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

The paper studies a rank function rk on countable structures from a hereditary class F that assigns an ordinal (or infinity) based on how far the structure is from containing the Fraïssé limit as a substructure. It proves that this function attains every countable ordinal for classes with free amalgamation and full extension property, for all finite tournaments, and for finite linear orders. In the linear order case an explicit formula ties the rank directly to the leading term in the Cantor normal form of the input ordinal. This establishes the rank property for these families and gives a concrete way to stratify countable members of the class by their universality deficit.

Core claim

Given a hereditary class F of finite relational structures, the rank function rk: σF → ω1 ∪ {∞} satisfies rk(X) = ∞ exactly when the Fraïssé limit of F embeds into X. The class F has the rank property if every countable ordinal appears as rk(X) for some countable X in the class. This property holds whenever F satisfies free amalgamation together with the full extension property, when F is the class of finite tournaments, and when F is the class of finite linear orders; in the last case the rank of an ordinal α ≥ ω whose leading Cantor normal form term is ω^{β1} · c1 equals ω · β1 + ⌊log2 c1⌋.

What carries the argument

The rank function rk introduced by Kubiš and Shelah, which assigns to each countable structure the least ordinal measuring its failure to contain the Fraïssé limit.

If this is right

Every countable ordinal is realized as the rank of some countable graph or hypergraph in the class.
The same holds for the class of all finite tournaments.
For linear orders the rank of α is completely determined by the leading Cantor normal form term of α.
The stratification by rank gives a complete ordinal-indexed hierarchy of countable structures short of universality in these classes.

Where Pith is reading between the lines

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

The explicit formula for orders links the rank directly to binary logarithm of the leading coefficient, suggesting a possible combinatorial interpretation in terms of binary expansions.
Similar rank computations might be feasible for other concrete Fraïssé classes such as partial orders or metric spaces once their amalgamation properties are verified.
The rank function could be used to define a notion of dimension or complexity for countable structures that are not homogeneous.

Load-bearing premise

The hereditary classes under consideration must satisfy the free amalgamation property together with the full extension property, or consist exactly of finite tournaments or finite linear orders, and the rank function must be well-defined on σF.

What would settle it

Exhibit a countable structure in one of the covered classes whose computed rank differs from the explicit formula for linear orders, or produce a class with free amalgamation whose rank function misses some countable ordinal.

read the original abstract

Given a hereditary class $\mathcal{F}$ of finite relational structures, the rank function $\mathsf{rk}:\sigma\mathcal{F}\to\omega_1\cup\{\infty\}$, introduced by Kubi\'{s} and Shelah, measures how far a countable structure is from being universal within its class: $\mathsf{rk}(X)=\infty$ if and only if the Fra\"{\i}ss\'{e} limit embeds into $X$. We say that $\mathcal{F}$ has the Rank Property (RP) if every countable ordinal is realized as the rank of some $X\in\sigma\mathcal{F}$. We develop the basic theory of the rank function and establish RP for three families of classes: those satisfying the free amalgamation property and the full extension property (covering graphs, hypergraphs, and many others); finite tournaments; and finite linear orders. For the latter, we compute the rank of every countable ordinal: if $\omega^{\beta_1}\cdot c_1$ is the leading Cantor normal form term of $\alpha\geq\omega$, then $\mathsf{rk}(\alpha)=\omega\cdot\beta_1+\lfloor\log_2 c_1\rfloor$.

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

The paper shows the Kubiš-Shelah rank realizes every countable ordinal for free-amalgamation classes, tournaments, and linear orders, with an explicit Cantor-normal-form formula for the last family.

read the letter

The core result is that the rank function from Kubiš and Shelah hits every countable ordinal for three families: classes with free amalgamation plus full extension, finite tournaments, and finite linear orders. For linear orders they give a direct formula: if the leading term of α is ω^β · c then rk(α) = ω·β + floor(log2 c). This organizes embedding distances at the ordinal level in a way that was not explicit before.

Referee Report

0 major / 2 minor

Summary. The paper develops the basic theory of the Kubiš-Shelah rank function rk: σF → ω1 ∪ {∞} for hereditary classes F of finite relational structures, where rk(X) = ∞ iff the Fraïssé limit embeds into X. It defines the Rank Property (RP) as the realization of every countable ordinal as rk(X) for some X ∈ σF. The authors prove RP for three families: classes with free amalgamation and full extension property (covering graphs and hypergraphs), the class of finite tournaments, and the class of finite linear orders. For linear orders they give an explicit formula: if ω^{β1} · c1 is the leading Cantor normal form term of α ≥ ω, then rk(α) = ω · β1 + ⌊log₂ c1⌋.

Significance. If the proofs hold, the work establishes the rank property for broad families of Fraïssé classes and supplies a concrete, gap-free computation of ranks for linear orders via Cantor normal form. This strengthens the model-theoretic toolkit for measuring distance from universality and connects ordinal arithmetic directly to embedding distances, with potential applications to other amalgamation classes.

minor comments (2)

The inductive construction of embeddings realizing prescribed ranks in the free-amalgamation case (mentioned in the skeptic's summary) would benefit from an explicit small example, e.g., for the class of graphs, showing how the rank increases by one at each successor step.
Notation for σF and the precise statement of the full extension property should be recalled in the statement of the main theorem for tournaments to improve readability for readers not familiar with Kubiš-Shelah.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their supportive summary of the paper and for recommending minor revision. No specific major comments appear in the report.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper develops the pre-existing Kubiš-Shelah rank function rk on σF via direct constructions (inductive embeddings for free-amalgamation + full-extension classes, back-and-forth for tournaments, and explicit Cantor-normal-form mapping for linear orders) that rely only on the stated hereditary and amalgamation hypotheses. The formula rk(α) = ω·β₁ + ⌊log₂ c₁⌋ is derived from standard ordinal arithmetic applied to the leading term of α, with no reduction to any fitted parameter, self-citation chain, or definitional equivalence internal to the paper. All load-bearing steps are externally grounded and self-contained.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on the prior definition of the rank function by Kubiš and Shelah together with standard background facts about hereditary classes, Fraïssé limits, free amalgamation, and ordinal arithmetic. No free parameters or invented entities are introduced.

axioms (2)

domain assumption The rank function rk is well-defined on σF for any hereditary class F as introduced by Kubiš and Shelah.
Invoked throughout the abstract as the object of study.
standard math Standard facts of ordinal arithmetic and Cantor normal form hold.
Used to state the explicit formula for linear orders.

pith-pipeline@v0.9.0 · 5516 in / 1504 out tokens · 41381 ms · 2026-05-13T07:56:06.368970+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear
We develop the basic theory of the rank function and establish RP for three families of classes: those satisfying the free amalgamation property and the full extension property... finite tournaments; and finite linear orders. For the latter, we compute the rank of every countable ordinal: if ω^{β₁}·c₁ is the leading Cantor normal form term of α≥ω, then rk(α)=ω·β₁ + ⌊log₂ c₁⌋.

Reference graph

Works this paper leans on

12 extracted references · 12 canonical work pages

[1]

An axiomatic approach to free amalgamation.Journal of Symbolic Logic, 82(2):648– 671, 2017

Gabriel Conant. An axiomatic approach to free amalgamation.Journal of Symbolic Logic, 82(2):648– 671, 2017

work page 2017
[2]

Sur l’extension aux relations de quelques propriétés des ordres.Annales Scientifiques de l’École Normale Supérieure, 71:363–388, 1954

Roland Fraïssé. Sur l’extension aux relations de quelques propriétés des ordres.Annales Scientifiques de l’École Normale Supérieure, 71:363–388, 1954

work page 1954
[3]

Ranks based on strong amalgamation Fraïssé classes.Archive for Mathematical Logic, 62:889–929, 2023

Vincent Guingona and Michael Parnes. Ranks based on strong amalgamation Fraïssé classes.Archive for Mathematical Logic, 62:889–929, 2023

work page 2023
[4]

Grundzüge einer Theorie der geordneten Mengen.Mathematische Annalen, 65:435– 505, 1908

Felix Hausdorff. Grundzüge einer Theorie der geordneten Mengen.Mathematische Annalen, 65:435– 505, 1908

work page 1908
[5]

Cam- bridge University Press, 1993

Wilfrid Hodges.Model Theory, volume 42 ofEncyclopedia of Mathematics and its Applications. Cam- bridge University Press, 1993

work page 1993
[6]

Games with finitely generated structures.Annals of Pure and Applied Logic, 172(10):103016, 2021

Adam Krawczyk and Wiesław Kubiś. Games with finitely generated structures.Annals of Pure and Applied Logic, 172(10):103016, 2021

work page 2021
[7]

Fraïssé sequences: category-theoretic approach to universal homogeneous structures

Wiesław Kubiś. Fraïssé sequences: category-theoretic approach to universal homogeneous structures. Annals of Pure and Applied Logic, 165(11):1755–1811, 2014

work page 2014
[8]

Evolution systems: a framework for studying generic mathemat- ical structures.arXiv preprint arXiv:2109.12600, 2021

Wiesław Kubiś and Paulina Radecka. Evolution systems: a framework for studying generic mathemat- ical structures.arXiv preprint arXiv:2109.12600, 2021. v5: August 2024

work page arXiv 2021
[9]

Evolution systems — an ordinal rank measuring universality,

Wiesław Kubiś and Saharon Shelah. Ranks on evolution systems, 2024. In preparation. Poster: “Evolution systems — an ordinal rank measuring universality,” August 2024, available athttps: //users.math.cas.cz/kubis/pdfs/ranksEvasPS_ver2.pdf

work page 2024
[10]

Alistair H. Lachlan. Countable homogeneous tournaments.Transactions of the American Mathemat- ical Society, 284:431–461, 1984

work page 1984
[11]

Dugald Macpherson

H. Dugald Macpherson. A survey of homogeneous structures.Discrete Mathematics, 311(15):1599– 1634, 2011

work page 2011
[12]

James H. Schmerl. Countable homogeneous partially ordered sets.Algebra Universalis, 9:317–321, 1979. Department of Mathematics, Bar-Ilan University, Ramat-Gan 5290002, Israel. Email address:lopezcc@biu.ac.il Centro de Ciencias Matemáticas, Universidad Nacional Autónoma de México, Campus Morelia, 58089, Morelia, Michoacán, México. Institut für diskrete Mat...

work page 1979