Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Topic: Construction of the Binary Tree
Replies: 25   Last Post: Oct 12, 2017 3:50 PM

 Messages: [ Previous | Next ]
 wolfgang.mueckenheim@hs-augsburg.de Posts: 3,193 Registered: 10/18/08
Re: Construction of the Binary Tree
Posted: Oct 7, 2017 4:37 AM

Am Samstag, 7. Oktober 2017 00:11:27 UTC+2 schrieb Dan Christensen:
> On Friday, October 6, 2017 at 4:22:13 PM UTC-4, WM wrote:

> >
> > There are aleph_0 steps completing all paths,

>
> You will need a formal proof of this,

No sober mind will need a proof in a formalism as dirty as "proving" finished infinity.

> But first, you will have to formalize the notion of "steps completing all paths."

We get to them simply by counting beyond the normal countable infinite, i.e., in a very natural and uniquely defined consistent continuation of the normal counting in the finite." [D. Hilbert: "Über das Unendliche", Math. Annalen 95 (1925) p. 169]
>
>

> > all are distinct, each one is completed by its own step. If so, then there are not more than aleph_0 paths.
> >

>
> This all looks rather far removed from set theory or formal logic

In order to prove that people who believe in the devil are silly fools you will hardly argue with the contents of the bible. Like proving that set theory is nonsense you will need only a sober mind and true logic - not formal first or second order "logic".

Regards, WM