摘要
定义了完全二叉树理论的决定公式 .利用该类公式证明了此理论是原子理论 ,且型的个数是可数的 .还给出了它的可数原子模型和饱和模型 .证明了完全二叉树理论的ω1
The determinant formulas of the theory of complete binary tree are defined and used in this paper to prove that the number of the types of this theory is countable and the theory is atomic. The countable atomic and saturated models are also built. Moreover, it is proved that the theory is categorical in every uncountable power but not in power ω .
出处
《北京师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2004年第2期177-180,共4页
Journal of Beijing Normal University(Natural Science)
基金
国家自然科学基金资助项目 ( 199310 2 0 )
关键词
完全二叉树理论
原子模型
饱和模型
型
ω1-范畴
the theory of complete binary tree
atomic model
saturated model
type ω 1 categorical
