User blog comment:Edwin Shade/Can Chess Ordinals Produce Functions With Uncountable Growth Rates ?/@comment-1605058-20171222153040/@comment-1605058-20171222230025

A well-ordering is an ordering on some set such that every nonempty subset has the smallest element. For example, every set of ordinals, together with its usual order, is a well-order. Another example would be the set of pairs of natural numbers under lexicographical order: \((a,b)<(c,d)\) if \(a<c\) or if \(a=c\) and \(b<d\). Nonexamples include the set of real numbers with the usual order.