This article is cited in 7 papers

Binary formulas in countably categorical weakly circularly minimal structures

B. Sh. Kulpeshov^a, A. B. Altaeva<sup>b

a</sup> International Information Technologies University, Manas str. 34A/Zhandosov str. 8A, Alma-Ata, 050040 Kazakhstan
^b Institute of Informatics and Control, ul. Pushkina 125, Alma-Ata, 050010 Kazakhstan

Abstract: Countably categorical weakly circularly minimal structures that are not $1$-transitive are studied. We give a characterization of the behavior of binary formulas acting on a set of realizations of a nonalgebraic $1$-type, and based on it, we present a complete description of countably categorical non-$1$-transitive weakly circularly minimal $n$-convex ($n>1$) almost binary theories of convexity rank $1$.

Keywords: circularly ordered structure, weak circular minimality, countable categoricity, convexity rank.

UDC: 510.67

Received: 28.12.2014

DOI: 10.17377/alglog.2016.55.304

 English version: Algebra and Logic, 2016, 55:3, 226–241

Bibliographic databases:

• 
•