Date: Feb 22, 2013 1:46 PM
Author: mueckenh@rz.fh-augsburg.de
Subject: Re: Matheology § 222 Back to the roots
On 22 Feb., 14:27, fom <fomJ...@nyms.net> wrote:

>

> what you are describing here is the structure of the

> natural numbers as a directed set.

>

> There is actual mathematics that describes this.

>

> There are logics in which your reasoning can be

> formalized.

That is not necessary for pople who can think without crutches.

>

> And the fact that this structure remains as absolute

> infinity relative to Cantor's transfinite arithmetic

> does not make that arithmetical calculus not

> mathematics.

Cantor has been disproved. Try to understand the Binary Tree. Then you

will understand that not more than countably many paths can be

distinguished.

Here is a summary of the argument concerning the Binary Tree:

1) The set of all real numbers of the unit interval is (said to be)

uncountable.

2) An uncountable set has (infinitely many) more elements than a

countable set.

3) Every real number has at least one unique representation as an

infinite binary string (some rationals have even two representations

but that's peanuts).

4) In many cases the string cannot be defined by a finite word.

5) Without loss of information the first bits of two strings, if

equal, need not be written twice.

6) Application of this rule leads to the Binary Tree.

7) The binary strings of the unit interval are isomorphic to the paths

of the Binary Tree.

8) It is not possible to distinguish more than countably many paths by

their nodes.

9) This is proven by constructing the Binary Tree node by node.

10) Further this is proven by colouring all edges and nodes and paths

of the complete Binary Tree by countably many paths.

Try to contradict at least one of the 10 treecommandments.

Regards, W;