edited by
7,703 views
6 votes
6 votes

Which of the following is principal conjunctive normal form for $[(p\vee q)\wedge\ \neg p \rightarrow \neg q ]$ ?

  1. $p\ \vee \neg q$
  2. $p \vee q $
  3. $\neg p \vee q$
  4. $\neg p\ \vee  \neg q$  
edited by

2 Answers

7 votes
7 votes

Conjunctive Normal Form of a given well formed formulae (wff) is an equivalent wff consisting of product of elementary sum terms.

Principal Conjunctive Normal Form of a given wff is an equivalent wff consisting of product of sums where each sum term consists of all variables used in the formulae in negated or non-negated form.



Here, one question may arise:

HOW THE REDUCED WFF IS IN PRINCIPAL CNF FORM?

ANSWER: 

In principal conjunctive normal form, every sum term must contain every variable, used in the given formulae, in negated or non-negated form. 

PRINCIPAL CNF FORM  ⟺ CANONICAL PRODUCT OF SUM FORM

Here in reduced formulae of the given question, there is only one sum term, which is:   p∨⏋q 

This sum term contains all variables used in the original wff ( p and q ) in negated or non-negated form i.e. p is in non-negated form and q is in negated form. 

This satisfies the condition of principal conjunctive normal form and hence the reduced wff is in PRINCIPAL CONJUNCTIVE NORMAL FORM.


Thus, answer is OPTION 1.

edited by
1 votes
1 votes
Precedence in propositional logic:  $\neg >\wedge> \vee> \rightarrow> \leftrightarrow$

$[(p \vee q)\wedge\ \neg p \rightarrow \neg q]$

$\implies [((p \vee q)\wedge\ \neg p) \rightarrow \neg q]$

$\implies [((p \wedge\ \neg p)\vee (q \wedge\ \neg p)) \rightarrow \neg q]$ (using distributive law)

$\implies [(0\vee (q \wedge\ \neg p)) \rightarrow \neg q]$

$\implies [(q \wedge\ \neg p) \rightarrow \neg q]$

$\implies [\neg (q \wedge\ \neg p) \vee \neg q]$  (using demorgan's law)

$\implies [\neg q \vee p \vee \neg q]$

$\implies [p \vee \neg q]$

$\therefore$ Option $1.$ is correct.
Answer:

Related questions

6 votes
6 votes
3 answers
1
Arjun asked Jul 2, 2019
1,881 views
Match List-I with List-II:$$\begin{array}{|c|c|c|c|} \hline {} & \text{List-I} & {} & \text{List-II} \\ \hline (a) & p \rightarrow q & (i) & \rceil ( q \rightarrow \rcei...
2 votes
2 votes
2 answers
3
Arjun asked Jul 2, 2019
7,138 views
How many ways are there to place $8$ indistinguishable balls into four distinguishable bins?$70$$165$$^8C_4$$^8P_4$
3 votes
3 votes
2 answers
4
Arjun asked Jul 2, 2019
5,808 views
How many bit strings of length ten either start with a $1$ bit or end with two bits $00$ ?$320$$480$$640$$768$