The set documentation [http://docs.python.org/3.4/library/stdtypes.html] states

"The subset and equality comparisons do not generalize to a complete ordering function. For example, any two disjoint sets are not equal and are not subsets of each other..."

Could "complete ordering" be changed to "total ordering"? This is the correct mathematical terminology. A total ordering is one where every pair is comparable. A complete ordering is one where each bounded subset has a supremum/infimum (for example, reals form a complete ordered field). This can be verified at Wikipedia [http://en.wikipedia.org/wiki/Total_order] and essentially every set theory book.

Another small thing: "For example, any two disjoint sets are not equal and are not subsets of each other, so all of the following return False: a<b, a==b, or a>b." It should be "any two nonempty disjoint sets".

New changeset a285ce18bd55 by Raymond Hettinger in branch '2.7':
Issue 17920:  Fix-up terminology in the set documentation
http://hg.python.org/cpython/rev/a285ce18bd55

New changeset 6ec04c5dae6e by Raymond Hettinger in branch '3.3':
Issue 17920:  Fix-up terminology in the set documentation
http://hg.python.org/cpython/rev/6ec04c5dae6e

Raymond, since this has been merged to default too in e163c13b941c, can the issue be closed or is there something else left to do?

It can be closed now.
Thanks for the reminder.