The compound statement (P∨Q)∧(∼P)⇒Q is equivalent to :
03Medium115×since 2008Q4381
(S1)(p⇒q)∨(p∧(∼q)) is a tautology
(S2)((∼p)⇒(∼q))∧((∼p)∨q) is a contradiction.
Then
04Easy115×since 2008Q4344
Which of the following Boolean expression is a tautology?
05Medium115×since 2008Q4382
Among the statements :
(S1)((p∨q)⇒r)⇔(p⇒r)(S2)((p∨q)⇒r)⇔((p⇒r)∨(q⇒r))
06Easy115×since 2008Q4419
Consider the following statements:
A : Rishi is a judge.
B : Rishi is honest.
C : Rishi is not arrogant.
The negation of the statement "if Rishi is a judge and he is not arrogant, then he is honest" is
07Easy115×since 2008Q4378
Which of the following statements is a tautology?
08Easy115×since 2008Q4342
The statement A → (B → A) is equivalent to :
09Easy115×since 2008Q4315
The Boolean expression
∼(p∨q)∨(∼p∧q) is equvalent to :
10Easy115×since 2008Q4316
If (p ∧∼ q) ∧ (p ∧ r) →∼ p ∨ q is false, then the truth values of p,q and r are, respectively :
11Easy115×since 2008Q4318
The Boolean expression ~(p ⇒ (~q)) is equivalent to :
12Hard115×since 2008Q4343
Let F₁(A, B, C) = (A ∧∼ B) ∨ [∼C ∧ (A ∨ B)] ∨∼ A and
F₂(A, B) = (A ∨ B) ∨ (B →∼A) be two logical expressions. Then :
13Medium115×since 2008Q4317
If p → (∼ p∨∼ q) is false, then the truth values of p and q are respectively :
14Easy115×since 2008Q4312
The negation of ∼s∨(∼r∧s) is equivalent to :
15Easy115×since 2008Q4313
The Boolean expression
(p∧∼q)∨q∨(∼p∧q) is equivalent to :
16Easy115×since 2008Q4330
The negation of the Boolean expression x ↔ ~ y is equivalent to :
17Hard115×since 2008Q4308
The statement p→(q→p) is equivalent to
18Medium115×since 2008Q4309
Statement-1 : ∼(p↔∼q) is equivalent to p↔q.
Statement-2 : ∼(p↔∼q) is a tautology.
19Hard115×since 2008Q4310
Consider :
Statement − I : (p∧∼q)∧(∼p∧q) is a fallacy.
Statement − II :(p→q)↔(∼q→∼p) is a tautology.