A well ordering is just some way of ordering a set made formal. Basically, if you have a set, you can find a relation such that any subset will have a least ele

A well ordering is just some way of ordering a set made formal. Basically, if you have a set, you can find a relation such that any subset will have a least element. I should also point out that the example given of a set that is not well-ordered is wrong. The proof was found to be erroneous.