C-Maximal Strong Partial Clones and the Inclusion Structure of Boolean Weak Bases

Strong partial clones are composition closed sets of partial operations containing all partial projections, characterizable as partial polymorphisms of sets of relations Gamma (pPol(Gamma)). If C is a clone it is known that the set of all strong partial clones whose total component equals C, has a greatest element pPol(Gamma(w)), where Gamma(w) is called a weak base. Weak bases have seen applications in computer science due to their usefulness for proving complexity classifications for constraint satisfaction related problems. In this article we (1) completely describe the inclusion structure between pPol(Gamma(w)), pPol(Delta(w)) for all Boolean weak bases Gamma(w) and Delta(w) and (2) in many such cases prove that the strong partial clones in question uniquely cover each other.