# Well-ordering the set of all finite sequences.

Let $(A,<)$ be well-ordered set, using <, how can one define well-order on set of finite sequences?

(I thought using lexicographic order)

Thank you!

-
What's the problem with the lexicographic order? –  Isaac Solomon Jan 5 '13 at 0:32
Haim told me to say hi. :-) –  Asaf Karagila Jan 5 '13 at 0:34
@AsafKaragila, now his question are famous! :) –  17SI.34SA Jan 5 '13 at 0:45
I would have written better questions! :-) –  Asaf Karagila Jan 5 '13 at 0:46

Generally speaking, if $\alpha$ and $\beta$ are two well-ordered sets, then we know how to well-order $\alpha\times\beta$ (lexicographically, or otherwise). We can define by recursion a well-order of $\alpha^n$ for all $n$, and then define the well-order on $\alpha^{<\omega}$ as comparison of length, and if the two sequences have the same length, $n$, then we can compare them by the well-order of $\alpha^n$.