On 4 Apr., 22:37, Virgil <vir...@ligriv.com> wrote:
> > In the Binary Tree there is no stop at any path. > > By the time one has a path one has infinitely many nodes in it, at least > for a CIBT.
Of course. If all FISONs are there, then all infinite paths are there too. > > > Or try (and fail) to define a limit > > that distinguishes both Binary Trees. > > The only binary tree of interest here is the Complete Infinite Binary > Tree in which each path is order isomorphic to |N.
Of course. It is impossible to miss this fact. It is impossible to distinguish the Binary Tree that lacks these paths.