全部

1·A reflexive relation that is also transitive is a preorder.

满足传递性的自反关系称为预序关系。

2·A synonym relation is reflexive, however, because every term is also a synonym of itself.

然而因为每个术语同时也是自己的同义词，同义词关系是反射性的。

3·Matrix to determine whether it is reflexive and symmetric, Discrete Mathematics in the binary relation.

判断矩阵是否是自反的，对称的，离散数学中的二元关系。

4·Remember, the supertype relation is reflexive.

记住超类型的关系是反身的。

5·Recall that an equivalence relation in a set is a reflexive, symmetric and transitive relation.

记得，一个等价关系，提出了一套是自反，对称和传递关系。

6·This paper gives a new concept of reflexive closure of fuzzy relation and symmetric closure of fuzzy relation, and also gives operation method and properties about it.

本文定义了模糊关系的自反闭包、对称闭包概念，同时给出了模糊关系的自反闭包、对称闭包的运算方法及性质。 打破了在原有的模糊关系只有传递闭包的局面。

7·Since optimum logic does not give a strict definition of concept 'optimum', it USES a non-reflexive, asymmetric and transitive relation as its optimum relation.

由于择优逻辑对“优”的概念未给出严格定义，因而择优逻辑一般使用的优选关系是一种具有禁自返、反对称和传递性的关系。

8·The definition of relation, relations properties about to reflexive and irreflexive, symmetric and antisymmetric and transitive, and its application in computer science has been recited.

介绍了关系的定义、关系的自反性和反自反性、对称性和反对称性、传递性五条性质，及其在计算机领域中的应用。