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
संबंधित प्रश्न
Express the following statement in symbolic form and write its truth value.
"If 4 is an odd number, then 6 is divisible by 3 "
Write the dual of the following statements: (p ∨ q) ∧ T
Write the dual of the following statements:
Madhuri has curly hair and brown eyes.
Prove that the following statement pattern is a tautology : ( q → p ) v ( 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."
Use the quantifiers to convert the following open sentence defined on N into true statement
5x - 3 < 10
Use the quantifiers to convert the following open sentence defined on N into true statement:
x2 ≥ 1
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) ∧ ∼ q] → ∼ p
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 ∨ r)] ↔ ∼ [p → (q → r)]
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) ∨ (∼p ∧ q)] ∧ r
Prepare truth tables for the following statement pattern.
(p ∧ r) → (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
If p is any statement then (p ∨ ∼p) is a ______.
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)
Show that the following statement pattern is contingency.
p ∧ [(p → ~ q) → q]
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 (p → q) ∧ (q → p)
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) ∧ [p ∨ ~ (q ∧ ~ r)]
Write the negation of the following statement.
∀ n ∈ N, n + 1 > 0
Write the negation of the following statement.
∃ n ∈ N, (n2 + 2) is odd number.
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)
Construct the truth table for the following statement pattern.
(p ∧ ~ q) ↔ (q → p)
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.
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)]
Using the truth table, prove the following logical equivalence.
p ↔ q ≡ ~(p ∧ ~q) ∧ ~(q ∧ ~p)
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) ∨ (p ∧ ~q) ∨ (~p ∧ ~q)
Examine whether the statement pattern
[p → (~ q ˅ r)] ↔ ~[p → (q → r)] is a tautology, contradiction or contingency.
Determine whether the following statement pattern is a tautology, contradiction, or contingency:
[(∼ p ∧ q) ∧ (q ∧ r)] ∧ (∼ q)
Write the negation of the following statement:
(p `rightarrow` q) ∨ (p `rightarrow` r)
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
(p ∧ q) → (q ∨ p)
