Is there a commonly-used name for a complete preorder (a transitive and total relation, Sloan's A000670 and A011782 for labeled and unlabeled, respectively) within set theory? (Not a total order, mind you -- it need not be antisymmetric.) I've heard the term "weak order", but that's from the same field that uses "linear order" for total orders, so I wanted some clarification if anyone knows of something else.(adsbygoogle = window.adsbygoogle || []).push({});

Also, does anyone know about counting the number of elements in complete relations? Götz Pfeiffer has an excellent paper Counting Transitive Relations about counting transitive relations (mentioning 26 classes of relations along the way), but he doesn't touch on the slightly-more-manegable complete relations at all.

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Complete preorders (and other binary relations)

Loading...

Similar Threads for Complete preorders binary | Date |
---|---|

B Not sure what this problem would be called... | Apr 4, 2017 |

Lattice/Complete lattice | Jun 10, 2014 |

Confidence of complete spatial randomness | May 8, 2014 |

Complete Random Design vs RCBD | Sep 7, 2013 |

Completeness notions in logic | Feb 23, 2013 |

**Physics Forums - The Fusion of Science and Community**