Binary formulas in countably categorical weakly circularly minimal structures (Q2364327)

In the paper under review, the authors study countably categorical weakly circularly minimal structures that are not 1-transitive. A circularly ordered structure \(M\) is circularly minimal if any definable (with parameters) subset of \(M\) is a union of finitely many intervals and points in \(M\). Let \(M\) be a countably categorical weakly circularly minimal structure, which is not 1-transitive, and \(p\in S_1(\emptyset)\) be nonalgebraic. It is proved that then any \(p\)-stable right-convex formula is equivalence-generating. This theorem describes the behavior of binary formulas acting on a set of realizations of a nonalgebraic 1-type (so-called \(p\)-stable right-convex formulas). Based on this theorem, the authors give a complete description of countably categorical weakly circularly minimal \(n\)-convex (\(n>1\)) almost binary theories of convexity rank 1 that are not 1-transitive.