🤖 AI Summary
This paper investigates the algebraic structure and diversity of clones generated by projection operators, focusing on a newly introduced class termed “partition clones.” Using universal algebra and equational logic, we establish, for the first time, a complete equational axiomatization for partition clones. We prove that partition clones are precisely the subdirect products of projection clones and admit a natural bijective correspondence with Boolean algebras; furthermore, their action algebras are characterized as Bergman-type Boolean action sets. The main contributions are threefold: (i) systematic introduction and equational axiomatization of partition clones; (ii) establishment of a full categorical equivalence between partition clones and Boolean algebras; and (iii) unification of clone theory with Boolean algebra actions within a universal algebraic framework. These results provide novel theoretical tools and foundations for clone classification, algebraic semantics modeling, and the algebraization of logic.
📝 Abstract
Clones are many-sorted algebraic structures abstracting the composition of finitary operations, and play a central role in universal algebra and theoretical computer science. In this paper, we investigate the variety of clones generated by the clone whose only elements are the projections. Inspired by the algebraic studies of conditional statements in programming, we provide an equational axiomatisation of this class of clones, which we call partition clones. We prove that every partition clone is a subdirect product of the clone of projections. Partition clones arise from Boolean algebras via a natural construction, and we show that every partition clone can be actually constructed in this way. Finally, we investigate the algebras associated with partition clones; we prove that they correspond precisely to sets equipped with an action of a Boolean algebra, aligning with a well-known definition due to Bergman.