retagged by
8,930 views
27 votes
27 votes

Choose the correct choice(s) regarding the following proportional logic assertion $S$:

$$S: (( P \wedge Q) \rightarrow R) \rightarrow (( P \wedge Q) \rightarrow (Q \rightarrow R))$$

  1. $S$ is neither a tautology nor a contradiction
  2. $S$ is a tautology
  3. $S$ is a contradiction
  4. The antecedent of $S$ is logically equivalent to the consequent of $S$
retagged by

9 Answers

0 votes
0 votes

$S : ((P \wedge Q) → R) → ((P \wedge Q) → (Q → R))$ 

Since Q is the most repetitive term here in this equation, let’s pick it to put True/False in the equation.

By-Case method
Case 1: $Q = True$ Case 1: $Q = False$

 $S : ((P \wedge True) → R) → ((P \wedge True) → (True→ R))$

$S : (P → R) → (P → R)$

$S : True$

 

 

 $S : ((P \wedge False) → R) → ((P \wedge False) → (False→ R))$

$S : ((False) → R) → ((False) → True)$

$S : (False → R) → True$

$S: True → True$

$S: True$

 

So, we can say that even if Q is True or False, the equation always simplifies to $True$.

Hence Tautology.

Also, we see that, even if Q is True or False, the Equation resolves to either:

$S: (P → R) → (P → R)$ ...(when $Q=True$) and

$S: (True) → (True)$ ...(when $Q=False$)

Therefore, we can say that antecedent (if) of $S$ is logically equivalent to the consequent (then) of $S$.

Therefore, answer is both (B) and (D)

0 votes
0 votes
S : ((P $\wedge$ Q) → R) → ((P $\wedge$ Q) → (Q → R))

Consequent of S :-  (P $\wedge$ Q)’ V (Q → R) $\equiv$ (P’ V Q’) V (Q’ V R) $\equiv$ (P’ V Q’ V R) $\equiv$ ((P $\wedge$ Q)’ V R) $\equiv$ ((P $\wedge$ Q) → R)

=> S : ((P $\wedge$ Q) → R) → ((P $\wedge$ Q) → R) $\equiv$ True.
Answer:

Related questions

10 votes
10 votes
4 answers
3
Arjun asked Feb 18, 2021
6,799 views
In the context of compilers, which of the following is/are $\text{NOT}$ an intermediate representation of the source program?Three address codeAbstract Syntax Tree $\text...