SearcharxivSearch

arXiv · 2511.06113

Notions of rank and independence in countably categorical theories

Abstract

For an $\omega$-categorical theory $T$ and model $\mathcal{M}$ of $T$ we define a hierarchy of ranks, the $n$-ranks for $n < \omega$ which only care about imaginary elements ``up to level $n$'', where level $n$ contains every element of $M$ and every imaginary element that is an equivalence class of an $\emptyset$-definable equivalence relation on $n$-tuples of elements from $M$. Using the $n$-rank we define the notion of $n$-independence. For all $n < \omega$, the $n$-independence relation restricted to $M_n$ has all properties of an independence relation according to Kim and Pillay with the {\em possible exception} of the symmetry property. We prove that, given any $n < \omega$, if $\mathcal{M} \models T$ and the algebraic closure in $\mathcal{M}^{\mathrm{eq}}$ restricted to imaginary elements ``up to level $n$'' which have $n$-rank 1 (over some set of parameters) satisfies the exchange property, then $n$-independence is symmetric and hence an independence relation when restricted to $M_n$. Then we show that if $n$-independence is symmetric for all $n < \omega$, then $T$ is rosy. An application of this is that if $T$ has weak elimination of imaginaries and the algebraic closure in $\mathcal{M}$ restricted to elements of $M$ of 0-rank 1 (over some set of parameters from $M^{\mathrm{eq}}$) satisfies the exchange property, then $T$ is superrosy with finite U-thorn-rank.

Explore related subjects

Keep this discovery

BibTeXRIS

Vera Koponen. 2025-11-08. Notions of rank and independence in countably categorical theories. https://doi.org/10.1017/jsl.2026.10224

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