On clones preserving a reflexive binary relation

Authors Andrei Krokhin, Dietmar Schweigert

Publication date 20 October 2002

Many-valued logic (03B50) Relational systems, laws of composition (08A02) Operations and polynomials in algebraic structures, primal algebras (08A40)

Review text

Let \({L}_A\) denote the lattice of clones on the set \(A\). For a clone \(C\) let \(C^{(1)}\) denote the unary operations of \(C\). For a submonoid \(M\) of the unary operations of \(A\) the following question was proposed by \textit{Ágnes Szendrei} [Clones in universal algebra, Séminaire Math. Supérieures 99, Les Presses de l'Université de Monteral (1996)]: determine the cardinality of the set \(\text{ Int}M=\{C\in L_A\mid C^{(1)}=M \}\). The authors investigate the size of \([\langle \text{Pol}_1\rho \rangle, \text{Pol} \rho]\), a subinterval of Int\((M)\). They show that in the case of a nontrivial binary reflexive relation, \(\rho\), that is not a linear order, \(|[\langle \text{Pol}_1\rho \rangle, \text{Pol }\rho]|=2^{\aleph_0}\). For the three-element linear oder \(|[\langle \text{Pol}_1\rho \rangle,\text{Pol} \rho ]|=7\). In case \(|A|=3\), the two theorems cover all clones on the three-element set. They suspect that for finite linear orders the size of this interval is finite and the general question remains open, as well.

Recommendations

Cited in

(5)

This page was built for publication: On clones preserving a reflexive binary relation

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