In article <email@example.com>, WM <firstname.lastname@example.org> wrote:
> On 22 Jan., 21:18, "Jesse F. Hughes" <je...@phiwumbda.org> wrote: > > WM <mueck...@rz.fh-augsburg.de> writes: > > > > That is potential infinity. That proof is not necessary, because the > > > set is obviously potentially infinite. No, you shoudl give a proof, > > > that there is a larger k than all finite k. > > > > Er, no. When I say that the union is infinite, I do not mean that it > > contains an infinite number. > > But you mean that the tree contains infinite paths.
|N is an complete infinite unary tree with only one path, itself.
|B is a Complete Infinite Binary Tree with a path for each subset of |N. --