全部

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

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

2·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.

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

3·An indifference relation derived this way will generally not be transitive.

这种方法得到的无差异关系通常不会被传递。

4·The equivalence relation defined by the (transitive closure of the) set of imposed constraints implies N L = N L

实施的约束集合（的传递封包）所定义的等价关系表明：N L = N L

5·And parents can have parents, creating a transitive subclass relation, conveniently accessible with the built-in function issubclass .

并且父亲还可以有父亲，创建一个传递的子类关系后，可以方便地利用内建的issubclass函数来判断继承关系。

6·This pager sets up a new matrix distinguishing way of a transitive binary-relation in a finite set based on analysis of transitive binary-relation.

文章对可传递关系进行了相应的讨论，并在此基础上给出了有限集合上可传递二元关系的矩阵判别方法。

7·A solution for signing any directed transitive binary relation is presented by combining the proposed scheme with the undirected transitive signature schemes available.

将该方案与无向传递签名方案结合，提出一个可对任何有向二元传递关系进行签名的方案。

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

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

9·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.

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