ugh B = {0, 1},
may vary from point to point across the domain X.

The diagram illustrates the &quot;factoring&quot; of the proposition
F : X -&gt; B through the &quot;medium&quot; or the intermediary of the
k-dimensional binary code space B^k.  Through this medium,
F is factored into the functional composition f(c(x)),
where c : X -&gt; B^k is the &quot;coding&quot; of each x in X as
a k-bit vector in B^k, and where f is the mapping
of these codes into a range that one interprets
as true-or-false values in