Maximal partial clones with no finite basis
E. Post described all clones on a 2-element set \(A\) and showed that every of these clones is finitely generated. This result does not hold for \(|A|\geq 3\). However, R. Freivalds has constructed a partial clone (i.e., a superposition closed subset of partial functions on \(A\) containing all projections) on a 2-element set which is not finitely generated. A partial clone is called strong if it contains all subfunctions of its partial functions. The authors give a criterion for recognizing not finitely generated strong partial clones and show that among all \(|A|+ 1\) maximal partial clones of Slupiecki type on \(A\), only one is finitely generated.
- Series parallel posets with nonfinitely generated clones
- Unique inclusions of maximal C-clones in maximal clones
- A maximal clone of monotone operations which is not finitely generated
- On minimal bases in full partial ultraclone of rank 2
- On closed classes in partial \(k\)-valued logic that contain the class of monotone functions
- Clones with majority function and their generalizations
- scientific article; zbMATH DE number 4181414 (Why is no real title available?)
- scientific article; zbMATH DE number 1775478 (Why is no real title available?)
- scientific article; zbMATH DE number 6930333 (Why is no real title available?)
- Counting the maximal partial clones on a finite set
- scientific article; zbMATH DE number 7536558 (Why is no real title available?)
- A survey on the fine-grained complexity of constraint satisfaction problems based on partial polymorphisms
- C-maximal strong partial clones and the inclusion structure of Boolean weak bases
This page was built for publication: Maximal partial clones with no finite basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1966166)