rzach

Possibly the Best xkcd Ever

Proof of Zermelo's well-ordering theorem given the Axiom of Choice: 1: Take S to be any set. 2: When I reach step three, if S hasn't managed to find a well-ordering relation for itself, I'll feed it into this wood chipper. 3: Hey, look, S is well-ordered.

Follow link for the mouseover text!

Posted in UncategorizedLeave a comment

Leave a Reply

Your email address will not be published. Required fields are marked *