Discrete math. Q33 Please. Example 2.4.7Rewriting Expressions Using the Sheffer StrokeUse Theorem 2.1.1 and the definition of Sheffer stroke to show thata. ~P = P|P and b. PVQ = (P|P)|(Q|Q).Solutiona. ~P=~(P ^ P)= P|Pby the idempotent law for Aby definition of l.b. PV Q=~(~(P v Q))= ~(~P ^~Q)= ~((P|P) ^ (Q|Q))(P|P)|(Q|Q)by the double negative lawby De Morgan's lawsby part (a)by definition of |. For the circuits corresponding to the Boolean expressionsin each of 30 and 31 there is an equivalent circuit with atmost two logic gates. Find such a circuit.30. (PA Q) v (~P^Q) v (~P ^~Q)31. (~P ^~Q) v (~P^ Q) v (P^~Q)32. The Boolean expression for the circuit inExample 2.4.5 is(P^Q^ R) V (P ^~Q^ R) V (P ^ ~Q ^ ~R)(a disjunctive normal form). Find a circuit with atmost three logic gates that is equivalent to this circuit.33. a. Show that for the Sheffer stroke ,PAQ = (P|Q)|(P|Q).b. Use the results of Example 2.4.7 and part (a)above to write P^(~Qv R) using onlySheffer strokes.

Name: Discrete math. Q33 Please. Example 2.4.7Rewriting Expressions Using th
Uploaded: 2024-03-20T06:38:58.000Z
Channel: Bartleby
Description: Discrete math. Q33 Please. Example 2.4.7Rewriting Expressions Using the Sheffer StrokeUse Theorem 2.1.1 and the definition of Sheffer stroke to show thata. ~P = P|P and b. PVQ = (P|P)|(Q|Q).Solutiona. ~P=~(P ^ P)= P|Pby the idempotent law for Aby def

Answered: 33. a. Show that for the Sheffer stroke…

Math

Advanced Math

33. a. Show that for the Sheffer stroke |, PAQ = (P|Q)|(P|Q). b. Use the results of Example 2.4.7 and part (a) above to write P^(~Q v R) using only Sheffer strokes.