total ordering
C39971
concept
A total ordering is a binary relation on a set in which every pair of elements is comparable, and the relation is transitive, antisymmetric, and total.
All labels observed (3)
| Label | Occurrences |
|---|---|
| System.Collections.IComparer implementation | 1 |
| total order | 1 |
| total ordering canonical | 1 |
Description generation (CDg)
The one-sentence description above was generated by prompting gpt-5.1 with the class name and this instruction.
Instruction
generate a one-sentence description for a given conceptual class. # Response Format Return only the sentence: "Description: [one-sentence description of the conceptional class]"
Input
Class: total ordering
Generated description
A total ordering is a binary relation on a set in which every pair of elements is comparable, and the relation is transitive, antisymmetric, and total.
Instances (3)
| Instance | Via concept surface |
|---|---|
| Knuth–Bendix order | — |
| CaseInsensitiveComparer | System.Collections.IComparer implementation |
| Sharkovsky ordering | total order |