The Binary Tree has countably many nodes and, according to Cantor, uncountably many paths.No attempt to save set theory.
But the basic element of the Binary Tree is the node
|
o
/ \
which splits an incoming sheave of paths into two sheaves of paths, i.e., it makes one more sheaf distinguishable from the already separated sheaves.
Therefore only countably many sheaves of paths (inclusing those carrying only one path) can get separated.
Regards WM
Regards, WM
| Date | Sujet | # | Auteur | |
| 29 Apr14:19 |  Cantor contradicted | 2 | wm | |
| 1 May13:54 |   Re: Cantor contradicted | 1 | wm |
Les messages affichés proviennent d'usenet.