Advertisements
Advertisements
Question
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
(p ↔ q) ∧ (p → ∼ q)
Advertisements
Solution
| p | q | ∼ q | p ↔ q | p → ∼ q | (p ↔ q) ∧ (p → ∼ q) |
| T | T | F | T | F | F |
| T | F | T | F | T | F |
| F | T | F | F | T | F |
| F | F | T | T | T | T |
The entries in the last column of the above truth table are neither all T nor all F.
∴ (p ↔ q) ∧ (p → ∼ q) is a contingency.
APPEARS IN
RELATED QUESTIONS
Express the following statement in symbolic form and write its truth value.
"If 4 is an odd number, then 6 is divisible by 3 "
If p : It is raining
q : It is humid
Write the following statements in symbolic form:
(a) It is raining or humid.
(b) If it is raining then it is humid.
(c) It is raining but not humid.
Express the following statement in symbolic form and write its truth value.
"If 4 is an odd number, then 6 is divisible by 3."
Write the negation of the following statement :
If the lines are parallel then their slopes are equal.
Determine whether the following statement pattern is a tautology, contradiction or contingency:
[(p ∧ (p → q)] → q
Prepare truth tables for the following statement pattern.
p → (~ p ∨ q)
Examine whether the following statement pattern is a tautology, a contradiction or a contingency.
(p ∧ ~ q) → (~ p ∧ ~ q)
Examine whether the following statement pattern is a tautology, a contradiction or a contingency.
~ p → (p → ~ q)
Prove that the following statement pattern is a tautology.
(p → q) ↔ (~ q → ~ p)
Prove that the following statement pattern is a tautology.
(~p ∧ ~q ) → (p → q)
Prove that the following statement pattern is a tautology.
(~ p ∨ ~ q) ↔ ~ (p ∧ q)
Prove that the following statement pattern is a contradiction.
(p ∨ q) ∧ (~p ∧ ~q)
Prove that the following statement pattern is a contradiction.
(p ∧ q) ∧ ~p
If p is any statement then (p ∨ ∼p) is a ______.
Show that the following statement pattern is contingency.
(p → q) ↔ (~ p ∨ q)
Show that the following statement pattern is contingency.
(p → q) ∧ (p → r)
Using the truth table, verify
p → (p → q) ≡ ~ q → (p → q)
Prove that the following pair of statement pattern is equivalent.
p → q and ~ q → ~ p and ~ p ∨ q
Write the negation of the following statement.
∀ n ∈ N, n + 1 > 0
Write the negation of the following statement.
Some continuous functions are differentiable.
Using the rules of negation, write the negation of the following:
~(p ∨ q) → r
Using the rules of negation, write the negation of the following:
(~p ∧ q) ∧ (~q ∨ ~r)
With proper justification, state the negation of the following.
(p ↔ q) v (~ q → ~ r)
Construct the truth table for the following statement pattern.
(p ∧ ~ q) ↔ (q → p)
Determine whether the following statement pattern is a tautology, contradiction, or contingency.
[(p ∧ q) ∨ (~p)] ∨ [p ∧ (~ q)]
Determine whether the following statement pattern is a tautology, contradiction, or contingency.
[(~p ∧ q) ∧ (q ∧ r)] ∨ (~q)
Determine whether the following statement pattern is a tautology, contradiction, or contingency.
[p → (~q ∨ r)] ↔ ~[p → (q → r)]
Using the truth table, prove the following logical equivalence.
p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)
Using the truth table, prove the following logical equivalence.
p ∧ (~p ∨ q) ≡ p ∧ q
Write the converse, inverse, contrapositive of the following statement.
If 2 + 5 = 10, then 4 + 10 = 20.
Write the converse, inverse, contrapositive of the following statement.
If a man is bachelor, then he is happy.
Write the converse, inverse, contrapositive of the following statement.
If I do not work hard, then I do not prosper.
State the dual of the following statement by applying the principle of duality.
(p ∧ ~q) ∨ (~ p ∧ q) ≡ (p ∨ q) ∧ ~(p ∧ q)
Write the dual of the following.
(~p ∧ q) ∨ (p ∧ ~q) ∨ (~p ∧ ~q)
Express the truth of the following statement by the Venn diagram.
Some members of the present Indian cricket are not committed.
The false statement in the following is ______.
Choose the correct alternative:
If p → q is an implication, then the implication ~q → ~p is called its
Complete the truth table.
| p | q | r | q → r | r → p | (q → r) ˅ (r → p) |
| T | T | T | T | `square` | T |
| T | T | F | F | `square` | `square` |
| T | F | T | T | `square` | T |
| T | F | F | T | `square` | `square` |
| F | T | T | `square` | F | T |
| F | T | F | `square` | T | `square` |
| F | F | T | `square` | F | T |
| F | F | F | `square` | T | `square` |
The given statement pattern is a `square`
The statement pattern (p ∧ q) ∧ [~ r v (p ∧ q)] v (~ p ∧ q) is equivalent to ______.
Which of the following is not equivalent to p → q.
Which of the following is not true for any two statements p and q?
The statement pattern (∼ p ∧ q) is logically equivalent to ______.
Write the negation of the following statement:
(p `rightarrow` q) ∨ (p `rightarrow` r)
Show that the following statement pattern is a contingency:
(p→q)∧(p→r)
If p → q is true and p ∧ q is false, then the truth value of ∼p ∨ q is ______
