114 views

2 Answers

Best answer
4 votes
4 votes

Statement S : (p ∨ ¬q) ∧ (q ∨ ¬r) ∧ (r ∨ ¬p)

S can be written as :

$\Rightarrow (p + {q}').(q + {r}').(r + {p}')$

$\Rightarrow pqr + {p}'{q}'{r}'$

$\therefore S = pqr + {p}'{q}'{r}'$


Let, $x_{1} = pqr$ & $x_{2} = {p}'{q}'{r}'$

S = $x_{1} + x_{2}$

Now, we want S to be TRUE.

S is TRUE when :

Case 1 : $x_{1}$ = T & $x_{2}$ = F

Case 2 : $x_{1}$ = F & $x_{2}$ = T

Case 3 : $x_{1}$ = T & $x_{2}$ = T


Case 1 : $x_{1}$ = T & $x_{2}$ = F

$x_{1}$ = pqr

In $x_{1}$ if atleast one of p, q, r is FALSE then $x_{1}$ will become FALSE. So, in order to be $x_{1}$ be TRUE

then p = T & q = T & r = T. Then $x_{1}$ will be TRUE and $x_{2}$ will automatically become FALSE.

Then, S = T + F = T

Hence, S will be evaluated as TRUE.

Here, p, q, r have same truth value as TRUE (p = q = r = TRUE).


Case 2 : $x_{1}$ = F & $x_{2}$ = T

$x_{1}$ = pqr & $x_{2}$ = ${p}'{q}'{r}'$

If we want $x_{1}$ = F & $x_{2}$ = T simultaneously then it is only possible when

p = F & q = F & r = F. Then $x_{1}$ will be FALSE and $x_{2}$ will automatically become TRUE.

Then, S = F + T = T

Hence, S will be evaluated as TRUE.

Here, p, q, r have same truth value as FALSE (p = q = r = FALSE).


Case 3 : $x_{1}$ = T & $x_{2}$ = T

This case is not feasible because it is NOT POSSIBLE to make $x_{1}$=T & $x_{2}$=T at the same time.


From Case 1 & Case 2 we have proved that (p ∨ ¬q) ∧ (q ∨ ¬r) ∧ (r ∨ ¬p) is true when p, q, and r

have the same truth value.

selected by
0 votes
0 votes

Lets solve this with little intuition ;

Question: (P∨ ¬Q) ∧ (Q ∨ ¬R) ∧ (R ∨ ¬P)

Formula used Here:   (¬P v Q) is logically equivalent to (P → Q).

with this equivalance we can reformat this question as

  • (Q→P) ∧ (R→Q) ∧ (P→R)
Now, I am going to ask you to look closely. 
 
lmplication is false only when the consequent(conclusion) is false and antecedent(hypothesis) is true otherwise it is true;
  • Try not to make any of these two conjuction(AND) false; We can do this by avoiding the situation where hypothesis is TRUE and conclustion is FALSE(T→ F=F).

  • Second option by makeing hypothesis False and conclusion True, doing so we end up Falsifying one of the conjuction(AND), which makes our propositional Formula false.

  • and the third option is either we choose to make both hypothesis and conclusion False(FF=T) or Both True(T→T=T). This Option is Suitable for making our  propositional Formula True.
 
This leads us to a conclusion that the propositional variables must be have the same truth value to be true.
 
 

 

Related questions

104
views
2 answers
2 votes
Tanay1 asked May 11
104 views
Which of these sentences are propositions? What are the truth values of those that are propositions?a) Boston is the capital of Massachusetts.b) Miami is the capital of Florida.c) 2 + ... ) 5 + 7 = 10.e) x + 2 = 11.f ) Answer this question.
112
views
1 answers
1 votes
Tanay1 asked May 13
112 views
Let P (x) be the statement x can speak Russian and let Q(x) be the statement x knows the computer language C++. Express each of these sentences in terms of P ... or knows C++. d) No student at your school can speak Russian or knows C++.
1.3k
views
1 answers
0 votes
ykrishnay asked Mar 19, 2022
1,252 views
Let P (x), Q(x), and R(x) be the statements x is a professor, x is ignorant, and x is vain, respectively.Express each of these statements using quantifiers ... (b)what is the soution of d) cause i did not understand what the d) says?
322
views
1 answers
0 votes
ykrishnay asked Apr 20, 2022
322 views
can this topic “PRENEX NORMAL FORM(PNF) ” is necsesary for gate or just i skip this topic.