algebra universalis

, Volume 44, Issue 1–2, pp 169–185 | Cite as

Generating primitive positive clones

  • John W. Snow


Suppose \( \cal F \) is a set of operations on a finite set A. Define PPC(\(\cal F \)) to be the smallest primitive positive clone on A containing \( \cal F \). For any finite algebra A, let PPC#(A) be the smallest number n for which PPC(CloA) = PPC(Clo n A). S. Burris and R. Willard [2] conjectured that PPC#(A) ≤|A| when CloA is a primitive positive clone and |A| > 2. In this paper, we look at how large PPC#(A) can be when special conditions are placed on the finite algebra A. We show that PPC#(A) ≤|A| holds when the variety generated by A is congruence distributive, Abelian, or decidable. We also show that PPC#(A) ≤|A| + 2 if A generates a congruence permutable variety and every subalgebra of A is the product of a congruence neutral algebra and an Abelian algebra. Furthermore, we give an example in which PPC#(A) ≥|A| - 1)2 so that these results are not vacuous.

Key words: Primitive positive clone, congruence distributive variety, Abelian variety, decidable variety, congruence permutable variety, congruence neutral algebra. 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Verlag Basel, 2000

Authors and Affiliations

  • John W. Snow
    • 1
  1. 1.Department of Mathematics, Concordia University, Seward, Nebraska 68434, USA, e-mail: jsnow@seward.cune.eduUS

Personalised recommendations