Does anyone else immediately lost interest in the article at the word "mansplaining"? Like, why do we need tp bring this in a discussion about logic and theoretical cs? Also if you post something in a public manner and people state their disagreement, that's not mansplaining...
More importantly, the argument that American settlers and later government policies deliberately exterminated large populations of natives does not even remotely rest on this. Are you really conflating them? Are you that ignorant of the history?
You also don't seem to understand the concept of genocide, the whole point of which is that it's extra bad to kill off a population as it gets smaller.
What a disgusting excuse for a thought process. What is it do you think that's wrong with you that gives you such a deep need to ensure that your ancestors were morally pure?
Computer SCIENCE is that ugly thing that tells us that three-valued logic gives rise to 19683 distinct binary logical operators, while two-valued has 16.
Computer SCIENCE is that ugly thing that tells us that if you want a computer language over a three-valued logic to be expressively complete, then you need to implement all of those 19683 logical binary operators one way or another. In the worst case, that's 19683 operator names for the programmer to remember. And you come here claiming that it's "trivial" because you have a "sense" of what the results ought to be ? That proves just one thing but site policy probably won't allow me to spell that out.
(In case you were wondering what the 16 names are in two-valued logic : they aren't needed because the system being two-valued gives rise to certain symmetries that gracefully allow us to reduce the set we need to remember to just {AND OR NOT} (or some such) which beautifully parallels the way we communicate in everyday life.)
First, the same argument above is also an argument that, say, integers, are not "Computer SCIENCE".
More to the point, you might enjoy reading the work of Charles Pierce and other logicians of that era who began to explore many variations on formal logic. Note that just as many operations arise from trinary relations in bivalent logic. Are binary relations "Computer SCIENCE", but not trinary or higher relations? Before you answer, you might want to look into whether all possible relations can be expressed using only binary relations (hint: nope).
Look deeper into the concept of functional completeness (with respect to a subset of operators), which you reference above without naming. You might be able to understand how many of those many trivalent operators are actually necessary to reason with (hint: not very many, hardly more than for bivalent logic, where, as you note, we only tend to use a few, and need not worry about it).
Consider also the relationship between operators folks have identified as useful in bivalent vs trivalent logic (hint: they not picking at random).
Could it be that just as with the 16 binary operators, many of which have relations to one another (e.g. inverses and complements, among others) that the trinary operators could fall into similar groups, which, making the 3^9 number you mentioned seem a whole lot less complex? Could that be why it's neither necessary nor customary to work with all the operators in either sort of logic?
Once you've caught up to state of the art in formal logic as of the 1930's you might have a new perspective -- perhaps you might even begin to let us know when "Computer SCIENCE" will catch up!