Advertisements
Advertisements
प्रश्न
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
उत्तर
- 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
संबंधित प्रश्न
Prove that the following statement pattern is equivalent :
(p ∨ q) → r and (p → r) ∧ (q → r)
Using truth table, examine whether the following statement pattern is tautology, contradiction or contingency: p ∨ [∼(p ∧ q)]
Express the following statement in symbolic form and write its truth value.
"If 4 is an odd number, then 6 is divisible by 3."
State if the following sentence is a statement. In case of a statement, write down the truth value :
√-4 is a rational number.
Using the truth table prove the following logical equivalence.
p ↔ q ≡ ∼ [(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) ↔ (p → q)
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
(∼ p → q) ∧ (p ∧ 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
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
Fill in the blanks :
Inverse of statement pattern p ↔ q is given by –––––––––.
Show that the following statement pattern is contingency.
(p → q) ∧ (p → r)
Prove that the following pair of statement pattern is equivalent.
p → q and ~ q → ~ p and ~ p ∨ q
Write the dual of the following:
p ∨ (q ∨ r) ≡ (p ∨ q) ∨ r
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 → 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 it snows, then they do not drive the car"
Using the truth table, prove the following logical equivalence.
p ∧ (~p ∨ q) ≡ p ∧ q
Write the dual of the following.
(~p ∧ q) ∨ (p ∧ ~q) ∨ (~p ∧ ~q)
Write the converse and contrapositive of the following statements.
“If a function is differentiable then it is continuous”
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`
Which of the following is not equivalent to p → q.
Using truth table verify that:
(p ∧ q)∨ ∼ q ≡ p∨ ∼ q
Write the negation of the following statement:
(p `rightarrow` q) ∨ (p `rightarrow` r)
