In article <firstname.lastname@example.org>, WM <email@example.com> wrote:
> > We cannot determine whether a path is missing until we have a list of > > the paths which are not missing > > Paths are determined, in mathematics, by nodes.
Paths in a Complete Infinite Binary Tree can be determined in any one of a large number of ways, not all of which require listing nodes but all of them determining the pattern of left or right branching of a path.
And until WM lists his paths, by whatever method he chooses to identify them, he has not proved his set of paths from a Complete Infinite Binary Tree is countable. And if it is countable, it is necessarily incomplete by some variation of the diagonal argument. --