Re: Cantor and the binary tree
- From: Gottfried Helms <helms@xxxxxxxxxxxxx>
- Date: Sat, 28 May 2005 11:56:11 +0200
Am 24.05.05 14:58 schrieb mueckenh@xxxxxxxxxxxxxxxxx:
> of paths always equals that of the nodes + 1. It is simply impossible
> to assume that one of these numbers becomes uncountably infinite while
> the other remains countably infinite.
No number can have the property of "being uncountable". What does
that mean? A mathematical concept may require "uncountable many
numbers (or uncountable many of whatever)". So it is "simply
impossible to assume, that one of these numbers becomes uncountably
infinite", I think so; and as well it is impossible, that "the
other remains countably infinite". Even the property of being "countable"
- is commonly used only as a property of an aggregate, not of a single
number (but that may be weakened by freedom of poetry ("i can count on
you"), I think.
Gottfried Helms
.
- Follow-Ups:
- Re: Cantor and the binary tree
- From: mueckenh
- Re: Cantor and the binary tree
- References:
- Cantor and the binary tree
- From: mueckenh
- Cantor and the binary tree
- Prev by Date: Re: Cantor and the binary tree
- Next by Date: Re: Help in answering news story on refutation of fermat's last theorem
- Previous by thread: Re: Cantor and the binary tree
- Next by thread: Re: Cantor and the binary tree
- Index(es):
Relevant Pages
|