2,110 views
4 votes
4 votes

which one is not tautology?

1.((p v q)^(r v s)) -> ((p^r) v q vs)

2. ((p v q)^(r v s)) -> (q v s)

3.((p v q)^(r v s)) -> (r v q v s)

4.((p v q)^(r v s)) -> (p v q v s)

5.((p v q)^(r v s)) -> (p v q)

please tell how to approach this types of qs,this type of qs came many times in gate.I tried it by making table,but it is not doable..so,help me.

3 Answers

Best answer
8 votes
8 votes

You can do that even without picking pen with the help of boolean algebra 

Note: $p\rightarrow q = \bar{p} \;or\;q = \bar{p}+q$

selected by
2 votes
2 votes

Simple Trick to solve such questions without anything......

See Try to prove that the given option is not tautology by making T--->F i.e., Try to make LHS of Implication True and RHS be False...

Opt a)

((p v q)^(r v s)) -> ((p^r) v q vs)

See LHS can be true only when and is true 

p V q can be true either q is true or p or both.

if q is made true then RHS also becomes true as q is there with Or

So if p is made true then r V s of LHS has to be true. ie. r or  s has to be true to make LHS true. (so i take p to be true)

If s is made true  then RHS also becomes true which we do not want as T-->T is True

if r is made true and since we had taken p as true as LHS then RHS also becomes true thus there is no scope that RHS becomes False.thus it is tautology..

Now Opt b)

((p v q)^(r v s)) -> (q v s)

proceed as above.

 Try to make LHS T and RHS F.

If q on LHS is made true then RHS becomes True which we do not want

So p has to be true in order to make LHS "and" True.

Now Either r or s has to be true so if we take s true then LHS becomes true  and consequently RHS becomes true. but now we put r as true it becomes that T--->F so it is not tautology...

So you can proceed with other options...With Practice it becomes clear

Related questions

2 votes
2 votes
2 answers
3
kd..... asked Jul 12, 2018
534 views
I am unable to prove following equations without using truth table1) p - (q v r) = (p->q) V (p->r) 2) ~(p <- q) = p <- ~q