摘要
从传递闭包的角度证明了判定一个关系是否具备传递性的充要条件,给出并证明了一条关于关系合成运算的定理。
This paper proofs the necessary and sufficient condition for judging that whether a binary relation was of transitivity from the point of view of transitive closure, aside, offers a theorem on compositive relation and proofs it.
出处
《四川教育学院学报》
2007年第1期104-104,107,共2页
Journal of Sichuan College of Education
基金
阿坝师专校级科研资助课题(ASB05-07)
关键词
二元关系
传递性
传递闭包
合成关系
binary relation
transitivity
transitive closure
compositive relation
