Re: Cantor Confusion

In article <1172253288.305584.116320@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
mueckenh@xxxxxxxxxxxxxxxxx wrote:

On 23 Feb., 14:35, "*** T. Winter" <***.Win...@xxxxxx> wrote:

Every tree T(n) contains only finite paths,
namely such with n nodes. There is no tree containing an infinite
path.

Then there can be no infinite trees, despite WM's many false claims
about the nature of such infinite trees.

Every set of finite subsets of N is countable. The set of all finite
subsets of N is countable.

> There are countably many unions like U(p(n)).

Prove it.

If A is countable, then the set of all finite sequences of elements of
A is countable.

But neither extends to the infinite subsets of A or infinite sequences
of elements of A.
.

Quantcast