A single binary function is enough (Q2837212)
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: A single binary function is enough |
scientific article; zbMATH DE number 6186382
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A single binary function is enough |
scientific article; zbMATH DE number 6186382 |
Statements
10 July 2013
0 references
local clone
0 references
countable clone
0 references
finitary operations
0 references
A single binary function is enough (English)
0 references
Let \(X\) be a non-empty set. Clones of finitary operations on \(X\) are considered. Let \({\mathcal O}\) denote the set of all finitary operations on \(X\). For any subset \(F\) of \({\mathcal O}\) the local clone generated by \(F\) consists of all operations on \(X\) that can be interpolated by operations from the clone generated by \(F\) on every finite set. The following results are proved: If \(X\) is infinite then every countable subset of \({\mathcal O}\) is included in a clone generated by a suitable binary operation. If \(X\) is countable then there exists a binary operation \(f\) on \(X\) such that the local clone generated by \(\{f\}\) equals \({\mathcal O}\). The local clone generated by a countable clone contains only countably many constant operations.NEWLINENEWLINEFor the entire collection see [Zbl 1234.08003].
0 references