| 1. | She has also contributed to the representation theory of distributive lattices.
|
| 2. | Examples 6 and 7 are distributive lattices which are not Boolean algebras.
|
| 3. | The consequences of these axioms include all the laws of distributive lattices.
|
| 4. | Thus, there are three equivalent ways of representing bounded distributive lattices.
|
| 5. | Every Riesz space is a distributive lattice and has the Riesz decomposition property.
|
| 6. | Characterize graphs of distributive lattices directly as diameter-preserving retracts of hypercubes.
|
| 7. | Since any Boolean algebra is a distributive lattice, this shows the desired implication.
|
| 8. | This construction produces the free distributive lattice with " n " generators.
|
| 9. | Thus, the Dedekind numbers count the number of elements in free distributive lattices.
|
| 10. | If yes, are there distributive lattices of finite length with infinitely many elements?
|
