Question: Let f, g: Bn B. Define the relation

Let f, g: Bn → B. Define the relation "<" on Fn, the set of all Boolean functions of n variables, by f ≤ g if the value of g is 1 at least whenever the value of f is 1.
(a) Prove that this relation is a partial order on Fn.
(b) Prove that fg ≤ f and f ≤ f + g.
(c) For n = 2, draw the Hasse diagram for the 16 functions in F2. Where are the minterms and maxterms located in the diagram? Compare this diagram with that for the power set of {a, b, c, d] partially ordered under the subset relation.

Step by Step Solution

3.52 Rating (176 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a For any f F n f has value 1 whenever f has value 1 so the relation is reflexive If f g F n ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

954-M-L-A-L-S (8466).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!