Advertisements
Advertisements
प्रश्न
Using the truth table prove the following logical equivalence.
p → (q → p) ≡ ∼ p → (p → q)
उत्तर
| 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| p | q | q → p | p → (q → p) | ∼ p | p → q | ∼ p → (p → q) |
| T | T | T | T | F | T | T |
| T | F | T | T | F | F | T |
| F | T | F | T | T | T | T |
| F | F | T | T | T | T | T |
The entries in columns 4 and 7 are identical.
∴ p → (q → p) ≡ ∼ p → (p → q)
APPEARS IN
संबंधित प्रश्न
Express the following statement in symbolic form and write its truth value.
"If 4 is an odd number, then 6 is divisible by 3 "
Prove that the following statement pattern is equivalent :
(p ∨ q) → r and (p → r) ∧ (q → r)
Write converse and inverse of the following statement:
“If a man is a bachelor then he is unhappy.”
Prove that the following statement pattern is a tautology : ( q → p ) v ( p → q )
Show that the following statement pattern in contingency :
(~p v q) → [p ∧ (q v ~ q)]
Write the negation of the Following Statement :
∀ y ∈ N, y2 + 3 ≤ 7
State if the following sentence is a statement. In case of a statement, write down the truth value :
√-4 is a rational number.
By constructing the truth table, determine whether the following statement pattern ls a tautology , contradiction or . contingency. (p → q) ∧ (p ∧ ~ q ).
Examine whether the following statement (p ∧ q) ∨ (∼p ∨ ∼q) is a tautology or contradiction or neither of them.
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)
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.
∼ (∼ q ∧ p) ∧ q
(p ∧ q) → r is logically equivalent to ________.
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 → r)] ↔ [(p ∧ q) → r]
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) ∨ (p ∨ ∼q) ∨ (∼p ∧ ∼q)
Determine whether the following statement pattern is a tautology, contradiction or contingency:
(p → q) ∨ (q → p)
Prepare truth tables for the following statement pattern.
(~ p ∨ q) ∧ (~ 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) ∧ (p ∧ ~ p)
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) ↔ ~ (p ∧ q)
Prove that the following statement pattern is a contradiction.
(p → q) ∧ (p ∧ ~ q)
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 ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)
Write the dual of the following:
(p ∨ q) ∨ r
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) → r
With proper justification, state 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)]
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 ∨ r)] ↔ ~[p → (q → r)]
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) ∧ ~(q ∧ ~p)
Using the truth table, prove the following logical equivalence.
~p ∧ q ≡ [(p ∨ q)] ∧ ~p
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 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) ∧ r ≡ p ∧ (q ∧ r)
Write the dual of the following.
~(p ∨ q) ≡ ~p ∧ ~q
The false statement in the following is ______.
Examine whether the statement pattern
[p → (~ q ˅ r)] ↔ ~[p → (q → r)] is a tautology, contradiction or contingency.
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 ______.
The equivalent form of the statement ~(p → ~ q) is ______.
The statement pattern (∼ p ∧ q) is logically equivalent to ______.
Write the negation of the following statement:
(p `rightarrow` q) ∨ (p `rightarrow` r)
If p → q is true and p ∧ q is false, then the truth value of ∼p ∨ q is ______
If p, q are true statements and r, s are false statements, then find the truth value of ∼ [(p ∧ ∼ r) ∨ (∼ q ∨ s)].
