摘要
本文概括了分配律在集合论、数理逻辑、偏序集中的表现形式及其相应的证明方法,并通过介绍论域理论的相关知识,给出Heyting代数关于取元素上确界和下确界运算满足分配律的特殊证明方法.
In this article,we summarized the representations and proving methods of distributed laws in the Set Theory,Symbolic Logic,and Poset respectively.By describing the related knowledge of the domain theory,the particular proving methods of Heyting algebra regarding to the application of the supremum and infimum for the purpose of accomplishing the requirements of the distributive laws are given.
出处
《中央民族大学学报（自然科学版）》
2009年第S1期36-40,共5页
Journal of Minzu University of China(Natural Sciences Edition)
