Negation of logical statement (p → q) v (p v q) is
Negation of logical statement (p → q) v (p v q) is
Option 1 -
Contradiction
Option 2 -
Tautology
Option 3 -
Neither contraction nor tautology
Option 4 -
Same as (q → p) ↔ (p →)
-
1 Answer
-
Correct Option - 1
Detailed Solution:Negation of (p → q) ∨ (p ∨ q)
~ [ (p → q) ∨ (p ∨ q)]
≡ ~ (p → q) ∧ ~ (p ∨ q)
[∴ ~ (p → q) ≡ p ∧ ~q]
≡ (p ∧ ~q) ∧ (~p ∧ ~q)
= F (contradiction)
Similar Questions for you
Case – I
it can be false if r is false,
so not a tautology
Case – II If
tautology
then
Case – I
pva
its negation as asked in question
=
=
mod (7)
…… (i)
Now,
……. (ii)
(i) & (ii)
kindly consider the following Image

q is equivalent to
Taking an Exam? Selecting a College?
Get authentic answers from experts, students and alumni that you won't find anywhere else
Sign Up on ShikshaOn Shiksha, get access to
- 65k Colleges
- 1.2k Exams
- 688k Reviews
- 1800k Answers