Advertisements
Advertisements
प्रश्न
Using the truth table proves the following logical equivalence.
∼ (p ↔ q) ≡ (p ∧ ∼ q) ∨ (q ∧ ∼ p)
Advertisements
उत्तर
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
| p | q | ∼ p | ∼ q | p ↔ q | ∼ (p ↔ q) | p ∧ ∼ q | q ∧ ∼ p | (p ∧ ∼ q) ∨ (q ∧ ∼ p) |
| T | T | F | F | T | F | F | F | F |
| T | F | F | T | F | T | T | F | T |
| F | T | T | F | F | T | F | T | T |
| F | F | T | T | T | F | F | F | F |
The entries in columns 6 and 9 are identical.
∴ ∼ (p ↔ q) ≡ (p ∧ ∼ q) ∨ (q ∧ ∼ p)
APPEARS IN
संबंधित प्रश्न
Examine whether the following logical statement pattern is a tautology, contradiction, or contingency.
[(p→q) ∧ q]→p
Write the converse and contrapositive of the statement -
“If two triangles are congruent, then their areas are equal.”
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)
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:
Madhuri has curly hair and brown eyes.
If p : It is raining
q : It is humid
Write the following statements in symbolic form:
(a) It is raining or humid.
(b) If it is raining then it is humid.
(c) It is raining but not humid.
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 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) ∨ (p ∨ q)] ∧ r ≡ 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
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
(∼ p → q) ∧ (p ∧ r)
Inverse of statement pattern (p ∨ q) → (p ∧ q) is ________ .
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 → q) ∨ (q → p)
Examine whether the following statement pattern is a tautology, a contradiction or a contingency.
(p ∧ ~ q) → (~ p ∧ ~ q)
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
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 ∧ ~ q)
Show that the following statement pattern is contingency.
(p → q) ∧ (p → r)
Using the truth table, verify.
p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)
Using the truth table, verify
p → (p → q) ≡ ~ q → (p → q)
Prove that the following pair of statement pattern is equivalent.
~(p ∧ q) and ~p ∨ ~q
Write the dual statement of the following compound statement.
Karina is very good or everybody likes her.
Write the negation of the following statement.
∀ n ∈ N, n + 1 > 0
Using the rules of negation, write the negation of the following:
(p → r) ∧ q
With proper justification, state the negation of the following.
(p ↔ q) v (~ q → ~ 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)
Construct the truth table for the following statement pattern.
(p ∨ ~q) → (r ∧ 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)] ∧ ~p
State the dual of the following statement by applying the principle of duality.
(p ∧ ~q) ∨ (~ p ∧ q) ≡ (p ∨ q) ∧ ~(p ∧ q)
Write the dual of the following.
(~p ∧ q) ∨ (p ∧ ~q) ∨ (~p ∧ ~q)
Write the dual of the following.
(p ∧ q) ∧ r ≡ p ∧ (q ∧ r)
Write the dual of the following.
p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (q ∨ r)
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`
If p → (∼p v q) is false, then the truth values of p and q are respectively
