Unformatted text preview: ≤ ” such that for any a, b ∈ L there is a least upper bound (lub) for a, b in L and a greatest lower bound (glb). (e) Let H = { , 1 , 2 , 3 } , with the natural order “ ≤ ”. Let C be the set oF subsets oF C = { a, b, c } . Consider the set oF L oF all pairs ( h, X ) where X is a subset oF C . i. How many elements does L have? Answer: 2 3 × 4 = 32 ii. Defne an ordering “ ≤ ” on L which makes it into a lattice. ( h, X ) ≤ ( h , X ) iF: Answer: and only if h ≤ h and X ⊆ X . Mike Burmester...
View
Full Document
 Fall '09
 Computer Security, Empty set, Supremum, Order theory

Click to edit the document details