×

zbMATH — the first resource for mathematics

Completeness of order algebras. (English) Zbl 1236.08004
Summary: 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.

MSC:
08A40 Operations and polynomials in algebraic structures, primal algebras
PDF BibTeX XML Cite
Full Text: Link