Advertisements
Advertisements
Question
What is tautology? What is contradiction?
Show that the negation of a tautology is a contradiction and the negation of a contradiction is a tautology.
Advertisements
Solution
- Tautology:
A statement pattern having truth value always T, irrespective of the truth values of its component statement is called a tautology. - Contradiction:
A statement pattern having truth value always F, irrespective of the truth values of its component statement is called a contradiction.
Let Statement p tautology. Consider, truth table
| p | ~ p |
| T | F |
i.e., negation of tautology is contradiction.
Let statement of contradiction. Consider, truth table
| q | ~ q |
| F | T |
i.e., negation of contradiction is tautology.
APPEARS IN
RELATED QUESTIONS
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) → 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 ∧ r) ≡ (p ∧ q) (p → r)
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) ∧ ∼ q] → ∼ p
(p ∧ q) → r is logically equivalent to ________.
Determine whether the following statement pattern is a tautology, contradiction or contingency:
[(p ∧ (p → q)] → q
Determine whether the following statement pattern is a tautology, contradiction or contingency:
[(p ∨ ∼q) ∨ (∼p ∧ q)] ∧ r
Examine whether the following statement pattern is a tautology, a contradiction or a contingency.
(~ q ∧ p) ∧ (p ∧ ~ p)
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)
Fill in the blanks :
Inverse of statement pattern p ↔ q is given by –––––––––.
Using the truth table, verify
p → (p → q) ≡ ~ q → (p → q)
Write the dual statement of the following compound statement.
Radha and Sushmita cannot read Urdu.
Write the negation of the following statement.
All the stars are shining if it is night.
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)
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 ∧ r) → (p ∨ ~q)
Construct the truth table for the following statement pattern.
(p ∨ r) → ~(q ∧ 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 dual of the following.
13 is prime number and India is a democratic country
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)
The converse of contrapositive of ∼p → q is ______.
