Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > sci.math > #644923 > unrolled thread

Cantor contradicted

Started bywm <wolfgang.mueckenheim@tha.de>
First post2026-04-29 15:19 +0200
Last post2026-05-01 14:54 +0200
Articles 2 — 1 participant

Back to article view | Back to sci.math


Contents

  Cantor contradicted wm <wolfgang.mueckenheim@tha.de> - 2026-04-29 15:19 +0200
    Re: Cantor contradicted wm <wolfgang.mueckenheim@tha.de> - 2026-05-01 14:54 +0200

#644923 — Cantor contradicted

Fromwm <wolfgang.mueckenheim@tha.de>
Date2026-04-29 15:19 +0200
SubjectCantor contradicted
Message-ID<10st0gh$15hfd$1@solani.org>
The Binary Tree has countably many nodes and, according to Cantor, 
uncountably many paths.

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

[toc] | [next] | [standalone]


#644938

Fromwm <wolfgang.mueckenheim@tha.de>
Date2026-05-01 14:54 +0200
Message-ID<10t27pt$17mdj$1@solani.org>
In reply to#644923
Am 29.04.2026 um 15:19 schrieb wm:
> The Binary Tree has countably many nodes and, according to Cantor, 
> uncountably many paths.
> 
> 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
> 
> 
No attempt to save set theory.

Regards, WM

[toc] | [prev] | [standalone]


Back to top | Article view | sci.math


csiph-web