Let "'Dist "'denote the category of bounded distributive lattices and bounded lattice homomorphisms.
32.
For a distributive lattice, the complement of " x ", when it exists, is unique.
33.
These graphs, especially in the case of distributive lattices, turn out to be closely related to median graphs.
34.
I've been wondereing lately if there are distributive lattices of length n with more than 2 n elements?
35.
In 1912, he was the first to describe a free distributive lattice generated by " n " elements.
36.
Any element " x " of a distributive lattice with top and bottom can have at most one complement.
37.
Furthermore, every complemented distributive lattice forms a Boolean algebra, and conversely every Boolean algebra forms a complemented distributive lattice.
38.
Furthermore, every complemented distributive lattice forms a Boolean algebra, and conversely every Boolean algebra forms a complemented distributive lattice.
39.
Completely distributive complete lattices ( also called " completely distributive lattices " for short ) are indeed highly special structures.
40.
Birkhoff's representation theorem has also been called the "'fundamental theorem for finite distributive lattices " '.
