Re: Cantor and the binary tree
- From: Virgil <ITSnetNOTcom#virgil@xxxxxxxxxxx>
- Date: Wed, 25 May 2005 11:06:15 -0600
In article <1117020755.470195.94300@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
mueckenh@xxxxxxxxxxxxxxxxx wrote:
> Virgil wrote:
>
> > > If no branching is possible without a new node (because a branching is
> > > a node), then "the infinite" does not at all help you. *That* is very
> > > easy to prove.
> >
> > How is it that all those things that WM declares so easy to prove still
> > remain unproven?
>
> It is very easily proven that a branching is impossible without a node,
> because, by definition, a branching _is_ a node.
I am not impressed by declarations that something is easy to prove.
I am only impressed by presentation of the proof itself.
.
- References:
- Cantor and the binary tree
- From: mueckenh
- Re: Cantor and the binary tree
- From: David C . Ullrich
- Re: Cantor and the binary tree
- From: mueckenh
- Re: Cantor and the binary tree
- From: Virgil
- Re: 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: an ideal problem
- Previous by thread: Re: Cantor and the binary tree
- Next by thread: Re: Cantor and the binary tree
- Index(es):
Relevant Pages
|