Year: 2002
Type: preprint
Abstract: We give a proof of I. G. Rosenberg's characterization of maximal clones. The theorem lists six types of relations on a finite set such that a clone over this set is maximal if and only if it contains just the functions preserving one of the relations of the list. In Universal Algebra, this translates immediately into a characterization of the finite preprimal algebras: A finite algebra is preprimal if and only if its term operations are exactly the functions preserving a relation of one of the six types listed in the theorem. The difficult part of the proof is to show that all maximal clones or preprimal algebras respectively are of that form. This follows from, and, as we also demonstrate, is indeed equivalent to, a characterization of primal algebras: We show that the primal algebras are exactly those whose term operations do not preserve any of the relations on the list.
Source: arXiv (Cornell University)
Author: Pinsker, Michael
Language: English
Topic: Advanced Algebra and Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1600699360