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.

Related MCQs

• A partial order ≤ is defined on the set S = {x, b1, b2, … bn, y} as x ≤ bi for all i and bi ≤ y for all i, where n ≥ 1. The number of total orders on the set S which contain the partial order ≤ is              
• If the longest chain in a partial order is of length l, then the partial order can be written as            disjoint antichains.
• The graph is the smallest non-modular lattice N5. A lattice is                if and only if it does not have a                isomorphic to N5.
• If each non-empty subset of a lattice has a least upper bound and greatest lower bound then the lattice is called ________.
• If in sets A, B, C, the set B ∩ C consists of 8 elements, set A ∩ B consists of 7 elements and set C ∩ A consists of 7 elements then the minimum element in set A U B U C will be?
• The bit strings for the sets are 1111100000 and 1010101010. The union of these sets is ____________.
• In a              the vertex set and the edge set are finite sets.
• If A is the set of students who play crocket, B is the set of students who play football then the set of students who play either football or cricket, but not both, can be symbolically depicted as the set
• Let X be a family of sets and R be a relation in X, defined by ‘A is disjoint from B’. Then, R is
• A                  has a greatest element and a least element which satisfy 0<=a<=1 for every a in the lattice(say, L).