Answers are grounded in this paper and cite their sources.
We study finitely homogeneous dependent rosy structures, adapting results of Cherlin, Harrington and Lachlan proved for [Formula: see text]-stable [Formula: see text]-categorical structures. In particular, we prove that such structures have finite þ-rank and are coordinatized by a þ-rank 1 set. We show that they admit a distal, finitely axiomatizable, expansion. These results show that there are, up to inter-definability, at most countably many dependent rosy structures [Formula: see text] which are homogeneous in a finite relational language.
No takes yet. Share an insight, caveat, or question.
Onshuus et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: