A relational structure is called reversible iff every bijective endomorphism of that structure is an automorphism. We characterize that property in the class of disconnected binary structures, and in one of its subclasses—posets that are disjoint union of chains. Also, using the concept of a monotone function from a class of structures preordered by monomorphism into a well founded relation, we detect additional classes of reversible disconnected posets. We further give equivalents of reversibility in some special classes of disjoint unions of chains. For example, we characterize CSB linear orders of a limit type and prove that a disjoint union of such linear orders is a reversible poset iff the corresponding sequence of order types is finite-to-one. We also show that a disjoint union of \(\sigma \)-scattered linear orders is a reversible poset, whenever the corresponding sequence of bi-embedability classes is finite-to-one.

关系结构被称为可逆的，前提是该结构的每个双射内同态都是自同构。我们在不连续的二进制结构的类及其子类之一（即链的不交集的位姿）中表征该属性。同样，使用单调函数的概念，将一类由单态性预先排列为良好关系的结构进行检测，我们可以检测出其他类的可逆不连续姿态。我们还对链的不相交联合的某些特殊类中的可逆性进行了等效处理。例如，我们对极限类型的CSB线性阶进行了刻画，并证明了这种线性阶的不相交并集是可逆的摆尾，前提是相应的阶次类型序列是有限对一的。我们还显示\（\ sigma \）的不相交的并集每当双可嵌入类的对应序列是有限的一对一时，散乱的线性阶数都是可逆的姿态。