Binary Formulas in Countably Categorical Weakly Circularly Minimal Structures

被引：0
|
作者：
B. Sh. Kulpeshov
A. B. Altaeva
机构：
[1] International Information Technologies University,
[2] Institute of Informatics and Control,undefined
来源：
Algebra and Logic | 2016年 / 55卷
关键词：
circularly ordered structure; weak circular minimality; countable categoricity; convexity rank;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：226 / 241
页数：15
相关论文
共 50 条
12345