On Jun 16, 1:19 pm, WM <mueck...@rz.fh-augsburg.de> wrote: > On 16 Jun., 13:41, William Hughes <wpihug...@hotmail.com> wrote: > > > > > 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. > > A ==> B
Yes, you agree A ==> B is true.
> > > > > You also claim > > > WM: There is no path p that can > > WM: be distinguished from every path of P. > > ~B
Yes, you claim ~B is true.
> > When you add subsets of nodes to the tree you create > > other subsets nodes in the tree that you did not add. > > That is a bare lie.
We have to deal with this claim before we can move on. Note we are talking about subsets of nodes.
> I add the paths p_n , that have a tail of zeros beginning at node n, > one by one, in the following order: > > 0 > -, 1 > -, 2, -, 3 > -, 4, ... >
> What unadded subset is created when what path is added? >
Note you ask for a subset of nodes not a path. I will give an example of a subset of nodes that is not a path.
You add the paths
At this point the subset of nodes
is in the tree, but q is not in any single element of P. Since only elements of P are added to the tree, q is not added to the tree.