On 14 Jun., 22:33, Virgil <virg...@nowhere.com> wrote:
> > 2) Path p cannot be distinguished from every path of P. > > Whatever countable set of paths, P, may be used to build a maximal > infinite binary tree, there are too many paths in the resulting tree to > be contained in the original P.
I have built a complete maximal binary tree by means of a countable set P of path. You may choose a path and prove wether it is in the tree or not. I will tell you afterwards what P is. But this is of no relevance, because every countable set of terminating paths or paths withg a special tail like 31415... or 121212... will yield the same tree.
