Boolean Algebra Question

71 Views Asked by At

my problem is ,Please give the algorithm: how can rewrite an arbitrary propositional formula alfa(α) into a proposional formula beta(β) so that beta does not contain disjunction(∧) and alfa is equivalent to beta ??

1

There are 1 best solutions below

0
On BEST ANSWER

Hint: Use De-Morgan's laws:

$$\lnot (A \land B) = (\lnot A) \lor (\lnot B) \\ \lnot (A \lor B) = (\lnot A) \land (\lnot B)$$

Notice that by taking the complement on both sides they may be written like this:

$$A \land B = \lnot ((\lnot A) \lor (\lnot B)) \\ A \lor B = \lnot((\lnot A) \land (\lnot B)) $$