On Jun 16, 6:52 am, WM <mueck...@rz.fh-augsburg.de> wrote: > On 16 Jun., 12:38, William Hughes <wpihug...@hotmail.com> wrote: > >
> > > On Jun 15, 4:44 pm, WM <mueck...@rz.fh-augsburg.de> wrote: > > > > On 15 Jun., 22:04, William Hughes <wpihug...@hotmail.com> wrote: >
Your claim is that "no possibility exists to construct or to distinguish by one or many or infinitely many nodes of the tree another path."
You have repeatedly noted
WM: If actually infinite paths exist, WM: then there is a path p that can be WM: distinguished from every path of P.
You also claim
WM: There is no path p that can WM: be distinguished from every path of P.
> > > Every path of the tree is from P. I explicitly forbid every other path > > > to enter my tree. > > > Nope. You cannot forbid every other path to enter the > > tree. You add nodes to the tree. > > I add infinite paths.
Which consist of subsets of nodes. When you add subsets of nodes to the tree you create other subsets nodes in the tree that you did not add.
> > > When you add a node to the tree you add subsets of nodes > > to the tree as well. You add a subset of nodes that is > > not in a single element of P. > > Wrong. I add a path p_n like > 0.himpidimpydowadididum000... > That path p_n is different from any other path p_m and there is no > path p_m that together with p_n produces anything different from all > finite subsets that are already contained in p_n or p_m.
Indeed, you do not produce a path by adding a single path. You produce a path by adding a set of paths.