Every finite subset of a lattice has ____________.

Related MCQs

• If each non-empty subset of a lattice has a least upper bound and greatest lower bound then the lattice is called ________.
• The graph is the smallest non-modular lattice N5. A lattice is                if and only if it does not have a                isomorphic to N5.
• A                  has a greatest element and a least element which satisfy 0<=a<=1 for every a in the lattice(say, L).
• Power set of empty set has exactly _____ subset.
• Any subset of edges that connects all the vertices and has minimum total weight, if all the edge weights of an undirected graph are positive is called                
• The inclusion of              sets into R = {{1, 2}, {1, 2, 3}, {1, 3, 5}, {1, 2, 4}, {1, 2, 3, 4, 5}} is necessary and sufficient to make R a complete lattice under the partial order defined by set containment.
• A sublattice(say, S) of a lattice(say, L) is a convex sublattice of L if                    
• A self complemented distributive lattice is called _______.
• In a bounded lattice, an element b belongs to L is called a complement of an element a belongs to L if ______.
• A __________ is a complemented distributive lattice.