On Jul 18, 3:59 pm, WM <mueck...@rz.fh-augsburg.de> wrote:
> P_a is a subset of the Binary Tree.
First, WM's 'P' is not yet defined, for the exact reasons I gave twice.
Second, previously WM gave P_a as a member of the "tree", as he said:
"The Binary Tree is a set of functions P_a [...]"
Now he says P_a is a subset of the "tree".
Which is it?
Both?
Meanwhile, my questions remain:
1) Is the index set for P the entire set w_1\w? I.e., what exactly is the domain of P? Is the domain of P the entire set w_1\w?
(2) If the domain of P is the set w_1\w, then am I correct that WM's binary tree is the range of some function P such that for each x in w_1\w, we have that P_x is in {f | f:N->{0 1}^N} ?
(3) If the answer to (2) is 'yes' then for each x in w_1\w, WHICH member of {f | f:N->{0 1}^N} do we set P_x to? I.e., what is the actual specification of the function?
Those are plain, clear, and precise questions about WM's OWN terminology. But WM seems incapable of answering them.
