General algebraic systems Definition
Lattice of clones
Definition
Let be a nonempty set and let be the set of all clones on . The lattice of clones on is the partially ordered set . For a family of clones, its meet is and its join is the clone generated by .
Remarks
The intersection of clones is a clone, since each clause of the definition of a clone is kept under intersections, so is a complete lattice. Example: on , the meet of the clones generated by and by is the clone of projections. Their join is the clone of all monotone operations that preserve both and . Check for the meet: the members of the first clone are the meets , and those of the second are joins. A meet of distinct variables differs from every join on some input, so only projections are in both. Non-example: the join is not the union in general. On , the union of the clones generated by and by is not a clone, since it misses the majority operation , which lies in their join. The lattice of clones on any set is an algebraic lattice whose compact elements are the finitely generated clones.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Clone concept
- Complete lattice concept
- Projection operation concept
- Lattice of clones definition
Further reading
About this page
| Tag | 73DXSAH73B |
|---|---|
| URI | m2://73DXSAH73B |
| Kind | definition |
| Writing | W0 stub |
| MSC | 08A40, 06B23 |
| Defines | Lattice of clones |
| Uses | Clone, Projection operation, Complete lattice |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.