Email this article Binary Formulas in Countably Categorical Weakly Circularly Minimal Structures
- Authors: Kulpeshov B.S.1, Altaeva A.B.2
-
Affiliations:
- International Information Technologies University
- Institute of Informatics and Control
- Issue: Vol 55, No 3 (2016)
- Pages: 226-241
- Section: Article
- URL: https://journal-vniispk.ru/0002-5232/article/view/233986
- DOI: https://doi.org/10.1007/s10469-016-9391-8
- ID: 233986
Cite item
Open Access
Access granted
Subscription Access
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.
About the authors
B. Sh. Kulpeshov
International Information Technologies University
Author for correspondence.
Email: b.kulpeshov@iitu.kz
Kazakhstan, Manas str. 34A/Zhandosov str. 8A, Alma-Ata, 050040
A. B. Altaeva
Institute of Informatics and Control
Email: b.kulpeshov@iitu.kz
Kazakhstan, ul. Pushkina 125, Alma-Ata, 050010
Supplementary files
