 The union of two prefix orders is the disjoint union, as it is with partial orders.Any bijective history preserving function is an order isomorphism.Furthermore, if for a given prefix ordered set "P" we construct the set "P- ≜ { p- | p∈ P}" we find that this set is prefix ordered by the subset relation ⊆, and furthermore, that the function "max