Re: Cantor Confusion
- From: WM <mueckenh@xxxxxxxxxxxxxxxxx>
- Date: 13 May 2007 04:54:37 -0700
On 12 Mai, 22:54, William Hughes <wpihug...@xxxxxxxxxxx> wrote:
On May 12, 4:28 pm, WM <mueck...@xxxxxxxxxxxxxxxxx> wrote:
<snip>
You should know:
The union (as I defined it for trees) of all finite trees is an
infinite tree with countably many nodes and countably many finite
paths. (If you like, you can union the nodes and the paths
separately.)
If we switch to the CIBT, then there is not a single node added. Only
the number of paths and their lengths changes from countable to
uncountable and from finite to infinite, respectively.
This is nothing more than the statement.
Let R be a countably infinite set.
the set of finite subsets of R is countable
the set of infinite subsets of R is uncountable.
Note the number of elements in R does not change.
The number of elements in any infinite subset is greater than the
number of elements in any finite subset, or not?.
When you change the size of the sets (the lengths of the
paths) you change the number of sets (the number of paths)
But in order to increase the length of the paths you have to add
nodes, haven't you?
Regards, WM
.
- Follow-Ups:
- Re: Cantor Confusion
- From: Virgil
- Re: Cantor Confusion
- From: William Hughes
- Re: Cantor Confusion
- References:
- Re: Cantor Confusion
- From: WM
- Re: Cantor Confusion
- From: William Hughes
- Re: Cantor Confusion
- From: WM
- Re: Cantor Confusion
- From: William Hughes
- Re: Cantor Confusion
- From: WM
- Re: Cantor Confusion
- From: William Hughes
- Re: Cantor Confusion
- From: WM
- Re: Cantor Confusion
- From: William Hughes
- Re: Cantor Confusion
- From: WM
- Re: Cantor Confusion
- From: William Hughes
- Re: Cantor Confusion
- From: WM
- Re: Cantor Confusion
- From: Virgil
- Re: Cantor Confusion
- From: WM
- Re: Cantor Confusion
- From: William Hughes
- Re: Cantor Confusion
- Prev by Date: Re: Paths
- Next by Date: Re: Cantor Confusion
- Previous by thread: Re: Cantor Confusion
- Next by thread: Re: Cantor Confusion
- Index(es):
Relevant Pages
|