Date: Jan 12, 2013 10:24 AM
Author: Ben Bacarisse
Subject: Re: Matheology § 191

WM <mueckenh@rz.fh-augsburg.de> writes:

> Matheology § 191
>
>
> The complete infinite Binary Tree can be constructed by first
> constructing all aleph_0 finite paths and then appending to each path
> all aleph_0 finiteley definable tails from 000... to 111...
>
> 0
> 1, 2
> 3, 4, 5, 6
> 7, ...
>
> This Binary Tree contains aleph_0 * aleph_0 = aleph_0 paths.


No, it contains aleph_0 * whatever the cardinality of the set of tails
is. Talk about begging the question!

<snip>
--
Ben.