SearcharxivSearch

arXiv · 2604.14461

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

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$.

Explore related subjects

Keep this discovery

BibTeXRIS

Carlos López-Callejas, Jareb Navarro-Castillo. 2026-04-15. A rank function for Fra\"{\i}ss\'{e} classes and the rank property. https://arxiv.org/abs/2604.14461

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO