edited by
1,657 views
1 votes
1 votes

Let $P, Q, R$ and $S$ be Propositions. Assume that the equivalences $P \Leftrightarrow (Q \vee \neg Q )$ and $Q \Leftrightarrow R$ hold. Then the truth value of the formula $(P \wedge Q) \Rightarrow ((P \wedge R) \vee S)$ is always

  1. True
  2. False
  3. Same as truth table of $Q$
  4. Same as truth table of $S$
edited by

1 Answer

5 votes
5 votes

P ⇔ (Q ∨ ¬ Q) "P should be true because RHS will be TRUE always "

Q ⇔ R "when Q is true R is true" and  "when Q is false R is false"

 $(P ∧ Q) ⇒ ((P ∧ R) ∨ S)$

there can be only 2 cases (value of S doesn't matter)

1) P = True, Q = True and R = True

        $(T ∧ T) ⇒ ((T ∧ T) ∨ S)$ 

         so this case is True

2) P =True, Q = R = False

        $(T ∧ F) ⇒ ((P ∧ R) ∨ S)$

        In case implication if the premises is false then whole statement is true

        this case is also true

The given expression is True in both the cases.

Answer is 1) True

Answer:

Related questions

1 votes
1 votes
3 answers
1
Arjun asked Nov 5, 2017
837 views
Which of the following routing technique / techniques is/are used in distributed systems?Fixed RoutingVirtual RoutingDynamic Routing(a) only(a) and (b) only(c) onlyAll (a...
1 votes
1 votes
2 answers
3
Arjun asked Nov 5, 2017
908 views
The Sigmoid activation function $f(t)$ is defined as$\dfrac{1}{\text{exp} (t) + \text{exp} (-t)}$$t \text{ exp}(-t)$$\dfrac{1}{1+ \text{exp} (t)}$$\dfrac{1}{1+ \text{exp...