fom
Posts:
1,968
Registered:
12/4/12


Re: Distinguishability of paths of the Infinite Binary tree???
Posted:
Dec 30, 2012 10:51 PM


On 12/30/2012 6:13 AM, WM wrote: > On 30 Dez., 10:46, fom <fomJ...@nyms.net> wrote: >> On 12/29/2012 11:22 AM, WM wrote: >> >> >> >> >> >>> On 28 Dez., 23:04, Virgil <vir...@ligriv.com> wrote: >>>> In article >>>> <2925a2eac16d483e91da3bb0084e7...@b16g2000vbh.googlegroups.com>, >> >>>> WM <mueck...@rz.fhaugsburg.de> wrote: >>>>> On 27 Dez., 21:49, Virgil <vir...@ligriv.com> wrote: >> >>>>>>> It is the set >>>>>>> of all finite paths extending from the root node to a given node. >> >>>>>> In every Complete Infinite Binary Tree, every finite path ends at the >>>>>> root node of of another Complete Infinite Binary Tree. So for every >>>>>> finite path, there are uncountably many extensions of it in every >>>>>> Complete Infinite Binary Tree. >> >>>>> And every extension is contained in the CIBT constructed from all >>>>> finite paths. >> >>>> Claimed but never proven. >> >>> Definitions need not be proven. > >> >> But you said that everything in mathematics >> had to be named and proven to exist. > > Trying to show that you are in a bad mood again?
Again...
But you said that everything in mathematics had to be named and proven to exist.

