Is there some knowledge or reference of how to convert some trinary logic systems into functionally complete boolean circuits/logic?
"Functionally complete" means all boolean functions can be computed. I am asking the more general question above in case the following more specific question does not have an answer. The motivation is more this specific following case. Consider the following "trinary truth table" for a single trinary operator.
a b c a a c a b c b b c a b c
Is it possible to somehow create functionally complete boolean circuits out of the single above trinary truth table operator? Or, maybe it can be definitively proven it's not possible?
I am also looking for any reference to that or something similar.