Also unknown, true or false?
At least for the logic I used (Kleene and Priest), the theory for that is clearly defined.
https://en.wikipedia.org/wiki/Three-valued_logic#Kleene_logic. See the table:
not U equals
U by definition. That means that a translation to boolean always results in true given both sides of a negation comparison.
It is firmly established mathematical theory and not computer science.The latter can be used for an implementation of the logic.
The theory is well explained in the link I gave you.
After all logically
not u equals any other
u and
u so a comparison in trits from
u and not u is always true, because it is
u..which is boolean true.
Most other ternary logics do exactly or close to the same.
Try to understand the presented truth tables. I based all my code on that.