edited by
13,656 views
51 votes
51 votes

Which one of the following propositional logic formulas is TRUE when exactly two of $p,q$ and $r$ are TRUE?

  1. $(( p  \leftrightarrow q)  \wedge  r)  \vee  (p \wedge q \wedge  \sim r)$
  2. $( \sim (p \leftrightarrow q) \wedge r)\vee (p \wedge q \wedge \sim r)$
  3. $( (p \to q) \wedge r) \vee (p \wedge q \wedge \sim r)$
  4. $(\sim (p \leftrightarrow q) \wedge r) \wedge (p \wedge q \wedge \sim r) $
edited by

12 Answers

2 votes
2 votes

  Consider 4,6,7 cases and check options.

$B)\\ (\sim (p\leftrightarrow q)\wedge r) \vee (p \wedge q \wedge \sim r)\\$

$4^{th}$ case

$=(\sim (F\leftrightarrow T)\wedge T) \vee (F \wedge T \wedge \sim T)\\ =(\sim F\wedge T) \vee F\\ =(T\wedge T) \vee F\\ =T \vee F\\ =T$

 

  Similarly Check $6^{th} \&\ 7^{th}$ cases.

  Correct Answer: B

0 votes
0 votes

In option (B) : 
We assume ‘p’ and ‘q’ to be TRUE. Therefore, ‘r’ is false because exactly two of ‘p’, ‘q’, and ‘r’ can be TRUE. 
p <--> q means if both ‘p’ and ‘q’ have same values then p <--> q is TRUE. So, ((p <--> r ) and r) evaluates to be FALSE. Therefore, ~((p <--> r ) and r) is TRUE. 
Here, two sub- expression are connected via OR operator and one of the sub-expression is TRUE. So, the complete expression becomes TRUE. 
 
Therefore, option (B) evaluates to be TRUE. 

Answer:

Related questions

28 votes
28 votes
6 answers
1
37 votes
37 votes
6 answers
2
gatecse asked Sep 15, 2014
6,631 views
Consider the statement "Not all that glitters is gold”Predicate glitters$(x)$ is true if $x$ glitters and predicate gold$(x)$ is true if $x$ is gold. Which one of the ...