Re: Cantor and the binary tree

*** T. Winter said:
> In article <MPG.1cfe8ee5a9650528989d2a@xxxxxxxxxxxxxxxxxxxxxxxxx> Tony Orlow (aeo6) <aeo6@xxxxxxxxxxx> writes:
> ...
> > So what? As you pointed out, when you add a node, you add a node, a branch,
> > and a path. Actually, you need to add two nodes for each path, but that is
> > irrelevant. They are finitely proportional, so if one is finite, the other
> > is, and if one is infinite, so is the other. Infinite trees have infinite
> > nodes and paths. Finite tree only have finite numbers of nodes and paths.
> > It's a fact.
>
> How do you jump from finite nodes to infinite nodes? An infinite path
> never ends.
>
An infinite path has infinite branches, right? Otherwise, what is infinite
about it? If it has infinite branches, it has infinite nodes, right? Otherwise,
what connects the branches? That's not a leap, but two step logical argument.
Which of those two steps do you object to?
--
Smiles,

Tony
.

Quantcast