The logical statement (p ⇒ q) ∧ (q ⇒~ p) is equivalent to:
The logical statement (p ⇒ q) ∧ (q ⇒~ p) is equivalent to:
Option 1 -
~q
Option 2 -
p
Option 3 -
q
Option 4 -
~p
-
1 Answer
-
Correct Option - 4
Detailed Solution:Truth table for (p → q) ∧ (q → ~p).
| p | q | p → q | ~p | q → ~p | (p → q) ∧ (q → ~p) |
|-|-|-|-|-|-|
| T | T | T | F | F | F |
| T | F | F | F | T | F |
| F | T | T | T | T | T |
| F | F | T | T | T | T |
The final column is F, T, which is the truth table for ~p.
Therefore, (p → q) ∧ (q → ~p) is equivalent to ~p.
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