Complete preorders (and other binary relations)

[CRGreathouse]

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.

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.

 

[Hurkyl]

I've heard the term "total preorder".

What's a "complete relation"? I've not heard the term before. Is it one where at least one of xRy and yRx is true?

 

[CRGreathouse]

I've heard the term "total preorder".

What's a "complete relation"? I've not heard the term before. Is it one where at least one of xRy and yRx is true?

Ah, yes, that's the term. I knew I had heard something like that, thanks.

Yes, xRy V yRx for every x, y in the set. What do you call that, totality?


In any case, on the second part of my question, I've been putting together a spreadsheet with the values (actually their logarithms, since otherwise they'd be prohibitively large) of combinations of properties for labeled binary relations. With C = complete/total, R = reflexive, S = symmetric, T = transitive, and A = antisymmetric, I have all 17 interesting combinations figured out now:
--, R, C, S, RS, T, TA, ST, RT, CT, CTA, A, RA, CA, STA, RTA, RST

I have a OEIS number for each one (with modification if needed), and values at least as far as Sloan's sequences go (and further in some cases).