Maximal partial clones with no finite basis (Q1966166)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximal partial clones with no finite basis |
scientific article; zbMATH DE number 1407117
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximal partial clones with no finite basis |
scientific article; zbMATH DE number 1407117 |
Statements
Maximal partial clones with no finite basis (English)
0 references
27 February 2000
0 references
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.
0 references
partial clone
0 references
finitely generated clone
0 references
Slupiecki clone
0 references