Hi,
The similar concept can be applied in Binary logic as well.

Hi,
If P is true, Q has to be true from (i)
If Q is true, R has to be true from (ii)
But for S to be true, either of Q or R has to be false, which is not the case.
So S has to be false.

Hi Venkat,
Yes, you can do by using truth tables.

Hi Vishal,
The conditions only go one way and not both ways.
When S is true, then either Q or R is false. But this does not mean that Q will always be true when S is false.
The value of S is dependent on Q or R to be false, and not the other way round. Q is independent of the value of S. Thus, the true condition would have been "If Q is true, then S is false".
I hope this helps.

Hi Shivani,
In the last statement, it is given that if S is true, then one of Q and R is false.
It is also given that when Q is true, R must be true.
Thus, if Q is true, S must be false.
Thus, when S is true, R must be true, as one of them has to be false.
So, if statement III has to be negated, this will give 3 conditions:
1. Both Q and R are true.
2. R is true.
3. Both Q and R are false.
I hope this helps. Regards