MVLSC HomeIssue Contents

Completeness of Order Algebras?
Ivan Chajda, Radomír Halas and Hajime Machida

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.

Keywords: Completeness, finite algebra, order algebra, implication, negation, clone.

Full Text (IP)