Pairwise intersections of Słupecki type maximal partial clones (Q1580086)

Let \(k\geq 2\) be an integer and \({\mathbf k}:= \{0,1,\dots, k-1\}\). For a positive integer \(n\), an \(n\)-ary partial operation on \({\mathbf k}\) is a map \(f: \text{dom}(f)\to {\mathbf k}\) where \(\text{dom}(f)\subseteq{\mathbf k}^n\) is called the domain of \(f\). Let \(\text{Par}^{(n)}({\mathbf k})\) denote the set of all \(n\)-ary partial operations on \({\mathbf k}\) and let \(\text{Par}({\mathbf k}):= \bigcup_{n\geq 1} \text{Par}^{(n)}({\mathbf k})\). A partial clone on \({\mathbf k}\) is a composition-closed subset of \(\text{Par}({\mathbf k})\) containing the set of all projections \(J_k\). A partial function \(g\in \text{Par}^{(n)}({\mathbf k})\) is a subfunction of \(f\in \text{Par}^{(n)}({\mathbf k})\) if \(\text{dom}(g)\subseteq \text{dom}(f)\) and \(g(\vec a)= f(\vec a)\) for all \(\vec a\in \text{dom}(g)\). A partial clone \(C\) is strong if it contains all subfunctions of its partial functions, i.e., if for every \(f\in C\) and \(g\in \text{Par}({\mathbf k})\), \(g\leq f\Rightarrow g\in C\). A partial clone \(C\) is a strong partial clone if and only if it contains the set of all partial projections on \({\mathbf k}\). A partial clone is called of Słupecki type if it contains all unary (total) functions on \({\mathbf k}\). A partial clone \(M\) is a maximal partial clone if \(M\) is covered by \(\text{Par}({\mathbf k})\). For \(F\subseteq \text{Par}({\mathbf k})\) the partial clone \(({\mathbf F})\) generated by \(F\) is the intersection of all partial clones containing the set \(F\). For \(3\leq h\leq k\), let \[ \tau_h:= \{(x_1,\dots, x_h)\in {\mathbf k}^h\mid |\{x_1,\dots, x_h\}|\leq h-1\}, \] \[ R_1= \{(x,y,z,t)\in {\mathbf k}^4\mid [x= y\text{ and }z= t]\text{ or }[x= z\text{ and }y= t]\text{ or }[x= t\text{ and }y= z]\}, \] and \[ R_2= \{(x,y,z,t)\in {\mathbf k}^4\mid [x= y\text{ and }z= t]\text{ or }[x= t\text{ and }y= z]\}. \] The authors give a description of all maximal partial clones of Słupecki type on \({\mathbf k}\). Theorem. Let \(k\geq 3\). Then there are exactly \(k+1\) maximal partial clones of Słupecki type on \({\mathbf k}\), namely \(M_k\), \(\text{pPol}R_1\), \(\text{pPol}R_2\), \(\text{pPol}\tau_3\), \(...,\;\text{pPol}\tau_k\). Theorem. Let \(\rho\in \{R_1, R_2\}\), \(\theta\in \{R_1,\tau_3,\dots, \tau_k\}\) with \(\rho\neq \theta\). Then the partial clone \(\text{pPol}\rho\cap \text{pPol}\theta\) is covered by the maximal partial clone \(\text{pPol}\theta\). Theorem. Let \(h\in \{4,\dots, k\}\), \(\theta\in \{R_1,R_2,\tau_3,\dots, \tau_{h-1}\}\). Then the partial clone \(\text{pPol}\tau_h\cap \text{pPol}R_i\) is covered by the maximal partial clone \(\text{pPol}R_i\). The intervals of partial clones are mostly of continuum cardinality on \({\mathbf k}\).