Advertisements
Advertisements
प्रश्न
Write the converse, inverse, contrapositive of the following statement.
If I do not work hard, then I do not prosper.
Advertisements
उत्तर
Let p : I do not work hard.
q : I do not prosper.
∴ The given statement is p → q.
Its converse is q → p.
If I do not prosper then I do not work hard.
Its inverse is ~p → ~q.
If I work hard then I prosper.
Its contrapositive is ~q → ~p.
If I prosper then I work hard.
APPEARS IN
संबंधित प्रश्न
Prove that the following statement pattern is a tautology : ( q → p ) v ( p → 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 :
Every quadratic equation has only real roots.
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 ∧ r) ≡ (p → q) ∧ (p → 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
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
(p ∧ q) → (q ∨ p)
Determine whether the following statement pattern is a tautology, contradiction, or contingency:
[(p ∨ q) ∧ ∼p] ∧ ∼q
Determine whether the following statement pattern is a tautology, contradiction or contingency:
(p ∧ q) ∨ (∼p ∧ q) ∨ (p ∨ ∼q) ∨ (∼p ∧ ∼q)
Determine whether the following statement pattern is a tautology, contradiction or contingency:
[(p ∨ ∼q) ∨ (∼p ∧ q)] ∧ r
Prepare truth tables for the following statement pattern.
(p ∧ r) → (p ∨ ~ q)
Prove that the following statement pattern is a contradiction.
(p ∧ q) ∧ ~p
Prove that the following statement pattern is a contradiction.
(p → q) ∧ (p ∧ ~ q)
Show that the following statement pattern is contingency.
(p → q) ↔ (~ p ∨ q)
Using the truth table, verify.
p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)
Using the truth table, verify
~(p → ~q) ≡ p ∧ ~ (~ q) ≡ p ∧ q.
Write the dual of the following:
p ∨ (q ∨ r) ≡ (p ∨ q) ∨ r
Using the rules of negation, write the negation of the following:
~(p ∨ q) → r
Construct the truth table for the following statement pattern.
(p ∨ r) → ~(q ∧ r)
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 ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)
Using the truth table, prove the following logical equivalence.
[~(p ∨ q) ∨ (p ∨ q)] ∧ r ≡ r
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.
State the dual of the following statement by applying the principle of duality.
p ∨ (q ∨ r) ≡ ~[(p ∧ q) ∨ (r ∨ s)]
Write the dual of the following.
p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (q ∨ r)
The statement pattern (∼ p ∧ q) is logically equivalent to ______.
If p → q is true and p ∧ q is false, then the truth value of ∼p ∨ q is ______
