• retagged by
21,960 views
67 67 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$

12 Answers

Best answer
71 71 votes
Antecedent of $S: (P \wedge Q) \to R$

$\qquad \equiv \neg ( P\wedge Q) \vee R$

$\qquad \equiv \neg P \vee \neg Q \vee R$

Consequent of $S : (P \wedge Q) \to (Q \to R)$

$\qquad\equiv  (P \wedge Q) \to (\neg Q \vee R)$

$\qquad\equiv \neg( P\wedge Q) \vee (\neg Q \vee R)$

$\qquad\equiv  \neg P \vee \neg Q \vee (\neg Q \vee R)$

$\qquad\equiv \neg P \vee \neg Q \vee R$

Antecedent of $S$ is equivalent to Consequent of $S.$ Hence Option D is right.

$A \to A$ is a Tautology. Hence options A and C are wrong and option B is right.

Correct Answer: B;D
• selected by
12 12 votes

Options $(b)$ and $(d)$.

Refer to the image below.

 

• edited by
6 6 votes

A tautology is a proposition that is always true for every value of its propositional variables.

A contradiction is a proposition that is always false for every value of its propositional variables.

Logically equivalent: Compound propositions with the same truth value in all possible cases are logically equivalent.

in another way, the compound propositions $p$ and $q$ are called logically equivalent if $p\leftrightarrow q$ is a tautology. 

$P$

$Q$

$R$ $P\land Q$ $((P\land Q)\rightarrow R)$ $(Q\rightarrow R)$ $((P\land Q)\rightarrow(Q\rightarrow R))$ $((P\land Q)\rightarrow R)\rightarrow((P\land Q)\rightarrow(Q\rightarrow R))$
$T$ $T$ $T$ $T$ $T$ $T$ $T$ $T$
$T$ $T$ $F$ $T$ $F$ $F$ $F$

$T$

$T$ $F$ $T$ $F$ $T$ $T$ $T$

$T$

$T$ $F$ $F$ $F$

$T$

$T$ $T$ $T$
$F$ $T$ $T$ $F$ $T$ $T$ $T$ $T$
$F$ $T$ $F$ $F$ $T$ $F$ $T$ $T$
$F$ $F$ $T$ $F$ $T$ $T$ $T$ $T$
$F$ $F$ $F$ $F$ $T$ $T$ $T$ $T$

It’s clearly visible from the above truth table that $S$ is a tautology as all its values are true. so option $B$ is true and $A$ is false.

$S$ is not a contradiction because all its values are true. so option $C$ is false.

 The antecedent of $S$ is logically equivalent to the consequent of $S$, this option is true.

 

From the above truth table, we can see that $((P\land Q)\rightarrow R)$ $\equiv$ $((P\land Q)\rightarrow(Q\rightarrow R))$ and their truth tables are the same.

Option $B,D$ are correct.

1 1 vote
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:
Position:
Show:

Related questions

56 56 votes
7 answers 7 answers
14.1k
14.1k views
Arjun asked Feb 18, 2021
14,061 views
Consider the following sets, where $n \geq 2$:$S_1$: Set of all $n \times n$ matrices with entries from the set $\{ a, b, c\}$$S_2$: Set of all functions from the set $\{...
43 43 votes
3 answers 3 answers
21.4k
21.4k views
Arjun asked Feb 18, 2021
21,437 views
Let $L_1$ be a regular language and $L_2$ be a context-free language. Which of the following languages is/are context-free?$L_1 \cap \overline{L_2}$$\overline{\overline{L...
19 19 votes
6 answers 6 answers
13.2k
13.2k views
Arjun asked Feb 18, 2021
13,216 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...
54 54 votes
3 answers 3 answers
23.8k
23.8k views
Arjun asked Feb 18, 2021
23,778 views
Which of the following statement(s) is/are correct in the context of $\text{CPU}$ scheduling?Turnaround time includes waiting timeThe goal is to only maximize $\text{CPU}...