The possible ones of these on some set form a lattice ordered by set inclusion called Con, and if a set is accompanied by one of these then it is referred to as a setoid.
The possible ones of these on some set form a lattice ordered by set inclusion called Con, and if a set is accompanied by one of these then it is referred to as a setoid. Equality is the  nest one of these on any set, and if a construct        is Euclidean and re exive then it is one of these. This kind of construct is a symmetric preorder and a transitive tolerance relation, and these objects   partition a set into their namesake classes. Examples of this type of relation include geometric similarity and modular congruence. For ten points, identify this kind of relation which must be re exive, symmetric, and transitive.
The possible ones of these on some set form a lattice ordered by set inclusion called Con, and if a set is accompanied by one of these then it is referred to as a setoid.
equivalence relation [do not accept or prompt on  equality ]