Re: Cantor and the binary tree
- From: Tony Orlow (aeo6) <aeo6@xxxxxxxxxxx>
- Date: Tue, 24 May 2005 16:30:45 -0400
Robert Kolker said:
> Tony Orlow (aeo6) wrote:
>
> >
> > The subsequent conclusion that the reals are not "countable" rests on the
> > notion that all countably infinite sets are the same size, which is an
> > assumption that I reject for many reasons, and which has no justification
> > besides "oo=oo=oo".
>
> Will you stop this sloppy nonsense and listen. Let two sets A, B be in
> one to one correspondence with the integers N by the mappings f and g
> respecitive then f : N ->A, g : N ->B. since f and b are bijections
> f_inverse maps A to N and the composition (g(f_inverse)) maps A onto B
> in a 1-1 fashion which means A is equivalent to B. QED.
>
> Now go away and learn some mathematics.
>
> Bob Kolker
>
>
That's all very well and good, if you specify f anf g and figure those
functions into your comparison. It's a mistake to ignore them.
--
Smiles,
Tony
.
- Follow-Ups:
- Re: Cantor and the binary tree
- From: Robert Kolker
- Re: Cantor and the binary tree
- References:
- Cantor and the binary tree
- From: mueckenh
- Re: Cantor and the binary tree
- From: Robert Kolker
- Re: Cantor and the binary tree
- From: Robin Chapman
- Re: Cantor and the binary tree
- From: Ron Sperber
- Re: Cantor and the binary tree
- From: aeo6
- Re: Cantor and the binary tree
- From: Robert Kolker
- Cantor and the binary tree
- Prev by Date: Re: Cantor was Right!
- Next by Date: Re: Cantor's Theory sucks
- Previous by thread: Re: Cantor and the binary tree
- Next by thread: Re: Cantor and the binary tree
- Index(es):
Relevant Pages
|