General algebraic systems Clones and operations Object
Post's lattice
Builds on CloneBoolean function
Description
Post's lattice is the lattice of clones on the two-element set , that is, the set of all clones of Boolean functions ordered by inclusion. Emil Post gave a complete description of it, published in 1941. Its main features are these.
- It is countably infinite.
- Every clone on is generated by finitely many Boolean functions.
- It has exactly five maximal clones, that is, coatoms below the clone of all Boolean functions. They consist of the operations that preserve , that preserve , that are monotone, that are self-dual, and that are affine.
- Its least element is the clone of projections.
Check of one maximal clone: the monotone operations form a clone, since projections are monotone and a composition of monotone operations is monotone. It is a proper clone, since negation is not monotone.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Boolean function concept
- Clone concept
- Post's lattice object
Further reading
About this page
| Tag | MA20X7JCET |
|---|---|
| URI | m2://MA20X7JCET |
| Kind | object |
| Writing | W0 stub |
| MSC | 08A40, 06E30, 03B50 |
| Instance of | Lattice of clones |
| Uses | Clone, Boolean function |
| Same as | |
| 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.