On 12 Jan., 02:14, Virgil <vir...@ligriv.com> wrote:
> > Cantor managed to prove that there are more than countably many finite > > binary strings possible. Remember, the part behind a_nn of a_n is not > > relevant for his proof. > > Quite so, but that in no way weakens his proof.
It shows a self-contradiction by the fact that there must be an antidiagonal that from every entry differs at a finite place. But if the list is complete with respect to all finite binary strings, this is obviously impossible.
