Advertisements
Advertisements
प्रश्न
Using the truth table prove the following logical equivalence.
p ↔ q ≡ ∼ [(p ∨ q) ∧ ∼ (p ∧ q)]
Advertisements
उत्तर
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| p | q | p ↔ q | p ∨ q | p ∧ q | ∼ (p ∧ q) | (p ∨ q) ∧ ∼ (p ∧ q) | ∼ [(p ∨ q) ∧ ∼ (p ∧ q)] |
| T | T | T | T | T | F | F | T |
| T | F | F | T | F | T | T | F |
| F | T | F | T | F | T | T | F |
| F | F | T | F | F | T | F | T |
The entries in columns 3 and 8 are identical.
∴ p ↔ q ≡ ∼ [(p ∨ q) ∧ ∼ (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)
Use the quantifiers to convert the following open sentence defined on N into true statement
5x - 3 < 10
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
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)
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.
(p ↔ q) ∧ (p → ∼ q)
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
∼ (∼ q ∧ p) ∧ q
Determine whether the following statement pattern is a tautology, contradiction or contingency:
[p → (q → r)] ↔ [(p ∧ q) → r]
Prepare truth tables for the following statement pattern.
(~ p ∨ q) ∧ (~ 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)
Prove that the following pair of statement pattern is equivalent.
p ↔ q and (p → q) ∧ (q → p)
Write the dual of the following:
~(p ∧ q) ≡ ~ 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.
All the stars are shining if it is night.
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
Write the converse, inverse, and contrapositive of the following statement.
"If it snows, then they do not drive the car"
Write the converse, inverse, and contrapositive of the following statement.
If he studies, then he will go to college.
With proper justification, state the negation of the following.
(p → q) ∧ r
Construct the truth table for the following statement pattern.
(p ∧ ~ q) ↔ (q → p)
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
Write the converse, inverse, contrapositive of the following statement.
If a man is bachelor, then he is happy.
Write the dual of the following.
~(p ∨ q) ≡ ~p ∧ ~q
Write the converse and contrapositive of the following statements.
“If a function is differentiable then it is continuous”
Choose the correct alternative:
If p → q is an implication, then the implication ~q → ~p is called its
Write the dual of the following.
13 is prime number and India is a democratic country
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
The statement pattern (p ∧ q) ∧ [~ r v (p ∧ q)] v (~ p ∧ q) is equivalent to ______.
Which of the following is not true for any two statements p and q?
The statement pattern (∼ p ∧ q) is logically equivalent to ______.
Show that the following statement pattern is a contingency:
(p→q)∧(p→r)
