It is shown that every finite order algebra having a kind of implication, negation and one more binary operation derived from the order is functionally complete. The proof is based on the classification of maximal clones invented by I.G. Rosenberg.
It is shown that every finite order algebra having a kind of implication, negation and one more binary operation derived from the order is functionally complete. The proof is based on the classification of maximal clones invented by I.G. Rosenberg. (en)