# Re: We Z'te

From: | <veritosproject@...> |

Date: | Tuesday, February 21, 2006, 0:28 |

Here's what I've gotten so far (I hope I'm making the right
conclusions, I don't have any clue about what we're talking about.)
j j j: (j = j) = j. Maybe j is true, because ((true = true) = true) is true.
r j r: (r = j) = r. Assuming that r does not equal j, (r = j) is
false, which is here defined to be equal to r. Maybe r is false.
r yj y: Continuing along the same thoughts, (r = yj) = y. Since r !=
j, yx might be an inversion function. y(null) would then be
equivalent to true. (false = opposite(true)) = opposite(false).
yr j a: (yr = j) = a. j is true, yr is true, so the left side is
true. a must be true, but then a would be true also.
a yj a: as in the last one, (true = not(true)) is false. But then a
would be false. a could be a mutable value.
ryr j Qa: Perhaps 3 letters is a small statement in itself. In this
case, (r = yr) is false, and (false = true) is false. This means that
(false = Q(anything)). Q might return a result so that both sides are
equal.
rjr j Qya: rjr is (false = true) = false, which is a true statement.
(true = true) is true, so j = Qya (see the definition of Q in the last
one.). But that would be impossible, since j is also Qa. By
definition, Qa != Qya. So maybe Q returns the thing that makes it
false?