Answer to Question #300106 in Discrete Mathematics for Yaku

Question #300106

Consider the statement form (P↓Q)↓R.


Now, find a restricted statement form logically equivalent to it, in

a) Disjunctive normal form (DNF).


b) Conjunctive normal form (CNF).



1
Expert's answer
2022-02-21T16:11:29-0500

Let us find a restricted statement form logically equivalent to (PQ)R(P \downarrow Q) \downarrow R , in


a) Disjunctive normal form (DNF).


Since


(PQ)R¬(¬(PQ)R)¬(¬(PQ))¬R(PQ)¬R(P¬R)(Q¬R),(P \downarrow Q) \downarrow R\equiv \neg(\neg(P\lor Q)\lor R) \equiv \neg(\neg(P\lor Q))\land \neg R \\\equiv (P\lor Q)\land \neg R \equiv (P\land \neg R)\lor( Q\land \neg R),


we conclude that (P¬R)(Q¬R)(P\land \neg R)\lor( Q\land \neg R) is a disjunctive normal form of a restricted statement.


b) Conjunctive normal form (CNF).


Taking into account that


(PQ)R¬(¬(PQ)R)¬(¬(PQ))¬R(PQ)¬R,(P \downarrow Q) \downarrow R\equiv \neg(\neg(P\lor Q)\lor R) \equiv \neg(\neg(P\lor Q))\land \neg R \equiv (P\lor Q)\land \neg R,


we conclude that (PQ)¬R(P\lor Q)\land \neg R is a conjunctive normal form of a restricted statement.



Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!

Leave a comment