Question
Question: Consider, Statement-I \[(p \wedge \sim q) \wedge \left( { \sim p \wedge q} \right)\] is a fallacy...
Consider,
Statement-I (p∧∼q)∧(∼p∧q) is a fallacy
Statement-II (p→q)↔(∼q→∼p) is a tautology
A) Statement-I is false, Statement-II is true
B) Statement-I is true, Statement-II is correct explanation for Statement-I
C) Statement-I is true, Statement-II is true and Statement-II is not correct explanation for Statement-I
D) Statement-I is true, Statement-II is false.
Solution
Here, the concept is solve by using truth table in the manner,
The proposition p and q denoted by p∧q is true when p and qare true, otherwise false
The proposition p and q denoted by p∨q is false when p and q are false, otherwise true
The propositionp, ∼p is called negation of p
The implication p→q is the proposition that is false when p is true and q is false and true otherwise.
The bi-conditional p↔q is the proposition that is true when p and q have the same truth values as false otherwise.
We use the above concept to find whether the statements are true or false.
Complete step-by-step answer:
Every statement is either true or false.
p | q | ∼p | ∼q | p∧∼q | ∼p∧q | (p∧∼q)∧(∼p∧q) |
---|---|---|---|---|---|---|
T | T | F | F | F | F | F |
T | F | F | T | T | F | F |
F | T | T | F | F | T | F |
F | F | T | T | F | F | F |
A compound proposition that is always false, no matter what the truth values of the propositions that occur is called a fallacy.
Hence the statement-I is true, (p∧∼q)∧(∼p∧q) is fallacy.
p | q | ∼p | ∼q | p→q | ∼q∧∼p | (p→q)↔(∼q∧∼p) |
---|---|---|---|---|---|---|
T | T | F | F | T | T | T |
T | F | F | T | F | F | T |
F | T | T | F | T | T | T |
F | F | T | T | T | T | T |
A compound proposition that is always true, no matter what the truth values of the propositions that occur is called a tautology.
Hence the statement-II is true, (p→q)↔(∼q∧∼p)is tautology.
Hence the option (c) is correct, the statement-I is true, statement-II is true and the statement-II is not the correct explanation for statement-I.
Note: The statements are either true or false. This is called the law of the excluded middle.
A truth table shows how the truth or falsity of a compound statement depends on the truth or falsity of the simple statements from which it’s constructed.