• recategorized by
7,911 views
36 36 votes
Obtain the principal (canonical) conjunctive normal form of the propositional formula $$(p \wedge q) \vee (\neg q \wedge r)$$ where $\wedge$ is logical and, $\vee$ is inclusive or and $\neg$ is negation.

4 Answers

Best answer
55 55 votes

Note:-

  1. Canonical conjunctive normal form means in our Digital logic it is Canonical Product of Sum term Form.
  2. Canonical Disjunctive normal form means in our Digital logic it is Canonical Sum of Product term Form.

$pq+q'r$
Putting in $\text{k-map},$ we will get

$\sum(1,5,6,7)= \prod(0,2,3,4)=(p\vee q\vee r) \wedge (p\vee¬q\vee r) \wedge (p\vee¬q\vee¬r) ∧ (¬p\vee q\vee r)$

• edited by
13 13 votes
$(p \vee \neg q\vee r)\wedge (p\vee \neg q\vee \neg r)\wedge (p\vee q\vee r)\wedge (\neg p\vee q\vee r)$
1 1 vote
you could also plot a kmap since its only 3 variables finding the output for all the combination will  be easy task
Position:
Show:

Related questions

66 66 votes
7 answers 7 answers
15.3k
15.3k views
Kathleen asked Oct 8, 2014
15,328 views
If the proposition $\lnot p \to q$ is true, then the truth value of the proposition $\lnot p \lor \left ( p \to q \right )$, where $\lnot$ is negation, $\lor$ is inclusiv...
14 14 votes
2 answers 2 answers
5.2k
5.2k views
go_editor asked Feb 12, 2018
5,200 views
What is the equivalent minimal Boolean expression (in sum of products form) for the Karnaugh map given below?
35 35 votes
4 answers 4 answers
7.0k
7.0k views
Kathleen asked Oct 8, 2014
7,009 views
What is the number of binary trees with $3$ nodes which when traversed in post-order give the sequence $A, B, C ?$ Draw all these binary trees.
36 36 votes
3 answers 3 answers
9.1k
9.1k views
Kathleen asked Oct 8, 2014
9,075 views
Consider the relation scheme.$$\begin{array}{|ll|ll|} \hline & \text{AUTHOR} & \text{(ANAME, INSTITUTION, ACITY, AGE)} \\\hline & \text{PUBLISHER} & \text{(PNAME, PCITY)}...