ABSTRACT

In the present talk we present two distinct techniques for the study of some preorders. One technique is used for the study of the representability of a kind of preorders associated to a "happened before" relation. This relation is quite common in distributed systems (computation) and in causality (theory of relativity). The second technique invites to consider the study of finite preorders (posets) through the permutations of the symmetric group.