Generating primitive positive clones

DOI10.1007/S000120050179MaRDI QIDQ1866838zbMATH OpenOpenAlexFDO

Authors John W. Snow

Publication date 23 April 2003

Published in Algebra Universalis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s000120050179

zbMATH Keywords

Abelian varietycongruence distributive varietycongruence neutral algebracongruence permutable varietydecidable varietyprimitive positive clone

Mathematics Subject Classification ID

Structure theory of algebraic structures (08A05) Operations and polynomials in algebraic structures, primal algebras (08A40) Congruence modularity, congruence distributivity (08B10)

Review text

A primitive positive formula is a first-order formula of the form \(\exists \;\wedge \) (atomic). A clone \(C\) on a set \(A\) is a primitive positive clone if every operation on \(A\) defined from operations in \(C\) using a primitive positive formula is again in \(C\). \textit{S. Burris} and \textit{R. Willard} [Proc. Am. Math. Soc. 101, 427-430 (1987; Zbl 0656.08002)] proved that there are finitely many primitive positive clones on any finite set. They conjectured that every such primitive positive clone is actually generated from its members of rank \(|A|\) if \(A\) has more than two elements. Suppose that for a finite algebra \textbf{A}, PPC\# (\textbf{A}) is the smallest number \(n\) for which PPC(Clo\textbf{A}), the primitive positive clone generated by Clo\textbf{A}, is equal to PPC(Clo\(_n\)\textbf{A}). In the paper the author discusses the problem how large PPC\# (\textbf{A}) can be when special conditions are assumed for the finite algebra \textbf{A}. It is shown that PPC\# (\textbf{A})\(\leq |A|+2\) if \textbf{A} generates a congruence permutable variety and every subalgebra of \textbf{A} is the product of a congruence neutral algebra and an Abelian algebra. PPC\# (\textbf{A})\(\leq |A|\) holds when the variety generated by \textbf{A} is congruence distributive, Abelian or decidable. Furthermore, an example is given for which PPC\# (\textbf{A})\(\geq (|A|-1)^2.\)

Recommendations

• On algebras with primitive positive clones
• Finitely Many Primitive Positive Clones
• scientific article; zbMATH DE number 3954991
• On Boolean primitive positive clones
• scientific article; zbMATH DE number 1356220
• scientific article; zbMATH DE number 3895132
• scientific article; zbMATH DE number 647603
• scientific article; zbMATH DE number 3853165
• Decidability of definability
• Algebras, lattices, varieties. Volume III

Cited in

(13)

• Primitive positive clones which are endomorphism clones
• Dualizing clones as models of Lawvere theories.
• A short introduction to clones.
• scientific article; zbMATH DE number 3853165 (Why is no real title available?)
• On algebras with primitive positive clones
• Finitely Many Primitive Positive Clones
• Primitive-positive maximal clones
• Extensions of the Positive Closure Operator by Using Logical Connectives
• scientific article; zbMATH DE number 3895132 (Why is no real title available?)
• Positive primitive structures
• Primitive positive formulas preventing a finite basis of quasi-equations
• Logical extensions of the parametric closure operator
• On Boolean primitive positive clones

This page was built for publication: Generating primitive positive clones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1866838)