Difference between revisions of "Lexicographic ordering"
(New page: Lexicographic (or dictionary ordering) is a strict total ordering <math><</math> on the <math>\alpha</math>-tuple <math>A = \prod_{\beta < \alpha} A_{\beta}</math> of totally ordered sets ...) |
(No difference)
|
Latest revision as of 18:42, 30 November 2007
Lexicographic (or dictionary ordering) is a strict total ordering on the -tuple of totally ordered sets for some ordinal using the strict total orderings of .
Formal Definition
For , letting and denote the components of and respectively, we say iff .