Partially ordered pattern algebras

Abstract

A partial order ≤ on a set A induces a partition of each power An into "patterns" in a natural way. An operation on A is called a ≤-pattern operation if its restriction to each pattern is a projection. We examine functional completeness of algebras with ≤-pattern fundamental operations.