|
This article is cited in 5 scientific papers (total in 6 papers)
Binary formulas in countably categorical weakly circularly minimal structures
B. Sh. Kulpeshova, A. B. Altaevab a 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.
Received: 28.12.2014
Citation:
B. Sh. Kulpeshov, A. B. Altaeva, “Binary formulas in countably categorical weakly circularly minimal structures”, Algebra Logika, 55:3 (2016), 341–365; Algebra and Logic, 55:3 (2016), 226–241
Linking options:
https://www.mathnet.ru/eng/al745 https://www.mathnet.ru/eng/al/v55/i3/p341
|
Statistics & downloads: |
Abstract page: | 194 | Full-text PDF : | 41 | References: | 41 | First page: | 4 |
|