Date: Apr 5, 2013 5:00 AM
Author: William Hughes
Subject: Re: Matheology § 224
On Apr 5, 8:00 am, WM <mueck...@rz.fh-augsburg.de> wrote:

> On 4 Apr., 23:21, William Hughes <wpihug...@gmail.com> wrote:

<snip>

> > If you take a set of nodes, and the parent/child

> > relationships, that contains all finite paths then

> > you have a tree that contains all finite paths. This tree contains

> > subsets of nodes that do not correspond to any finite path.

> > Some of these subsets are the subsets that correspond to what

> > might be termed infinite paths. However, if you use a definition

> > of path that excludes infinite paths, these subsets of nodes

> > remain, but they are not paths.

>

> They are path in an infinite Binary Tree.

How do you know these subsets are paths?

There are subsets of nodes that are not paths

(e.g. the subset consisting of all nodes

at a level greater than 5).