Re: WM and end segments...

On 7/22/2024 1:14 PM, WM wrote:

Le 22/07/2024 à 21:45, Alan Mackenzie a écrit :

WM <wolfgang.mueckenheim@tha.de> wrote:

 

Only a matheologian fixed in his views can claim that after knowing my game

>
We've known your game for years;

 You have not understood it. Otherwise if not agreeing you could show an error. But you can only curse:
 

 it is to obfuscate, confuse, and lie.

 

"You seem to be ignoring the fact that, after you have colored a countable family of pathes, say P0, P1, ..., Pn, ..., there may be other paths Q that are not on this countable list but have, nevertheless, had all their nodes and edges colored. Perhaps the first node and edge of Q were also in P1, the second node and edge of Q were in P2, etc. [...] by choosing the sequence of Pn's intelligently, you can, in fact, ensure that this sort of thing happens for every path Q." [Andreas Blass, loc cit]

>
It can happen for every FINITE path Q.

 Not for finite and not for infinite paths. If the second node is in P2, then also the first node is in P2. That is the principle of the Binary Tree.
 

An infinite path in an infinite binary tree can be coded as an infinite
sequence of Ls and Rs, corresponding to whether at the next node one goes
left or right.  So, for example, the very first path might be
LLLLLLLL.....

 It is impossible to use infinite sequences of Ls or Rs. What can be used is a finite abbreviation like "LLLLLLLL.....". But there are only countably many finite

Huh? lol. Humm... You are a HYPER Finite person. That about sums it up. Your mind cannot fathom infinity of any kind.
[...]