Given a hereditary class of finite relational structures, the rank function , introduced by Kubiś and Shelah, measures how far a countable structure is from being universal within its class: if and only if the Fraïssé limit embeds into . We say that has the Rank Property (RP) if every countable ordinal is realized as the rank of some . 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 is the leading Cantor normal form term of , then .

生成讲解博客的中文版本

生成AI智能校验的中文版本