Advertisements
Advertisements
Question
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
(p ∧ ∼ q) ↔ (p → q)
Solution
| p | q | ∼ q | p ∧ ∼ q | p → q | (p ∧ ∼ q) ↔ (p → q) |
| T | T | F | F | T | F |
| T | F | T | T | F | F |
| F | T | F | F | T | F |
| F | F | T | F | T | F |
All the entries in the last column of the above truth table are F.
∴ (p ∧ ∼ q) ↔ (p → q) is a contradiction.
[Note: Answer in the textbook is incorrect]
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 "
Using truth table examine whether the following statement pattern is tautology, contradiction or contingency `(p^^~q) harr (p->q)`
Write the dual of the following statements: (p ∨ q) ∧ T
Write converse and inverse of the following statement:
“If a man is a bachelor then he is unhappy.”
Show that the following statement pattern in contingency :
(~p v q) → [p ∧ (q v ~ q)]
Use the quantifiers to convert the following open sentence defined on N into true statement
5x - 3 < 10
State if the following sentence is a statement. In case of a statement, write down the truth value :
√-4 is a rational number.
Write converse and inverse of the following statement :
"If Ravi is good in logic then Ravi is good in Mathematics."
By constructing the truth table, determine whether the following statement pattern ls a tautology , contradiction or . contingency. (p → q) ∧ (p ∧ ~ q ).
Using the truth table prove the following logical equivalence.
∼ (p ∨ q) ∨ (∼ p ∧ q) ≡ ∼ p
Using the truth table prove the following logical equivalence.
p ↔ q ≡ ∼ [(p ∨ q) ∧ ∼ (p ∧ q)]
Using the truth table prove the following logical equivalence.
p → (q → p) ≡ ∼ p → (p → q)
Using the truth table prove the following logical equivalence.
(p ∨ q) → r ≡ (p → r) ∧ (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 ∨ q) ∨ (p ∨ q)] ∧ r ≡ r
Using the truth table proves the following logical equivalence.
∼ (p ↔ q) ≡ (p ∧ ∼ q) ∨ (q ∧ ∼ p)
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
(p ∧ q) → (q ∨ p)
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
(p → q) ↔ (∼ p ∨ q)
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
(p ↔ q) ∧ (p → ∼ q)
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
∼ (∼ q ∧ p) ∧ q
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
[p → (∼ q ∨ r)] ↔ ∼ [p → (q → r)]
(p ∧ q) → r is logically equivalent to ________.
Inverse of statement pattern (p ∨ q) → (p ∧ q) is ________ .
Prepare truth tables for the following statement pattern.
p → (~ p ∨ q)
Prepare truth tables for the following statement pattern.
(~ p ∨ q) ∧ (~ p ∨ ~ q)
Prepare truth tables for the following statement pattern.
(p ∧ r) → (p ∨ ~ q)
Prepare truth table for (p ˄ q) ˅ ~ r
(p ∧ q) ∨ ~ r
Examine whether the following statement pattern is a tautology, a contradiction or a contingency.
q ∨ [~ (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 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 ______.
Fill in the blanks :
Inverse of statement pattern p ↔ q is given by –––––––––.
Show that the following statement pattern is contingency.
(p → q) ↔ (~ p ∨ q)
Using the truth table, verify
~(p ∨ q) ∨ (~ p ∧ q) ≡ ~ p
Prove that the following pair of statement pattern is equivalent.
p ↔ q and (p → q) ∧ (q → p)
Write the dual of the following:
(p ∨ q) ∨ r
Write the dual statement of the following compound statement.
A number is a real number and the square of the number is non-negative.
Write the negation of the following statement.
∀ n ∈ N, n + 1 > 0
Write the negation of the following statement.
∃ n ∈ N, (n2 + 2) is odd number.
Write the negation of the following statement.
Some continuous functions are differentiable.
Using the rules of negation, write the negation of the following:
(p → r) ∧ q
Using the rules of negation, write the negation of the following:
(~p ∧ q) ∧ (~q ∨ ~r)
Write the converse, inverse, and contrapositive of the following statement.
If he studies, then he will go to college.
With proper justification, state the negation of the following.
(p → q) ∨ (p → 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)]
Using the truth table, prove the following logical equivalence.
[~(p ∨ q) ∨ (p ∨ q)] ∧ r ≡ r
Using the truth table, prove the following logical equivalence.
~p ∧ q ≡ [(p ∨ q)] ∧ ~p
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.
2 is even number or 9 is a perfect square.
Write the dual of the following.
~(p ∨ q) ≡ ~p ∧ ~q
Write the converse and contrapositive of the following statements.
“If a function is differentiable then it is continuous”
Choose the correct alternative:
If p is any statement, then (p ˅ ~p) is a
Write the dual of the following.
13 is prime number and India is a democratic country
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.
The equivalent form of the statement ~(p → ~ q) is ______.
Using truth table verify that:
(p ∧ q)∨ ∼ q ≡ p∨ ∼ q
Determine whether the following statement pattern is a tautology, contradiction, or contingency:
[(∼ p ∧ q) ∧ (q ∧ r)] ∧ (∼ q)
Examine whether the following statement pattern is a tautology or a contradiction or a contingency:
(∼p ∧ ∼q) → (p → q)
Prepare truth table for the statement pattern `(p -> q) ∨ (q -> p)` and show that it is a tautology.
If p, q are true statements and r, s are false statements, then find the truth value of ∼ [(p ∧ ∼ r) ∨ (∼ q ∨ s)].
