In article <d85d67ab-aa37-4091-9474-a089288c3b1b@x10g2000yqx.googlegroups.com>, WM <mueckenh@rz.fh-augsburg.de> wrote:
> On 23 Dez., 21:20, Zuhair <zaljo...@gmail.com> wrote: > > > Also the proof of Cantor is actually about uncountability of paths > > that are distinguishable on finite basis. > > That is the point!
The Cantor argument only deals with distinguishability on a finite basis (each individual listed entry differs from the "diagonal" at an "individual finite position") but shows that it can occur infinitely often. > > --
