Advertisements
Advertisements
प्रश्न
Using the truth table prove the following logical equivalence.
p ↔ q ≡ ∼ [(p ∨ q) ∧ ∼ (p ∧ q)]
उत्तर
| 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
संबंधित प्रश्न
Write the dual of the following statements:
Madhuri has curly hair and brown eyes.
Write converse and inverse of the following statement:
“If a man is a bachelor then he is unhappy.”
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
Write the negation of the Following Statement :
∀ y ∈ N, y2 + 3 ≤ 7
Write the negation of the following statement :
If the lines are parallel then their slopes are equal.
State if the following sentence is a statement. In case of a statement, write down the truth value :
√-4 is a rational number.
Write converse and inverse of the following statement :
"If Ravi is good in logic then Ravi is good in Mathematics."
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.
[p → (∼ q ∨ r)] ↔ ∼ [p → (q → r)]
(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) ∨ (∼p ∧ q) ∨ (p ∨ ∼q) ∨ (∼p ∧ ∼q)
Determine whether the following statement pattern is a tautology, contradiction or contingency:
[(p ∨ ∼q) ∨ (∼p ∧ q)] ∧ r
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 tables for the following statement pattern.
(p ∧ r) → (p ∨ ~ q)
Examine whether the following statement pattern is a tautology, a contradiction or a contingency.
q ∨ [~ (p ∧ q)]
Examine whether the following statement pattern is a tautology, a contradiction or a contingency.
(p ∧ ~ q) → (~ p ∧ ~ q)
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) → 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 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)
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)
Using the truth table, verify
~(p → ~q) ≡ p ∧ ~ (~ q) ≡ p ∧ q
Using the truth table, verify
~(p ∨ q) ∨ (~ p ∧ q) ≡ ~ p
Prove that the following pair of statement pattern is equivalent.
p → q and ~ q → ~ p and ~ p ∨ q
Prove that the following pair of statement pattern is equivalent.
~(p ∧ q) and ~p ∨ ~q
Write the dual of the following:
(p ∨ q) ∨ r
Write the dual of the following:
p ∨ (q ∨ r) ≡ (p ∨ q) ∨ r
Write the dual of the following:
~(p ∧ q) ≡ ~ p ∨ ~ q
Write the dual statement of the following compound statement.
13 is prime number and India is a democratic country.
Write the negation of the following statement.
All the stars are shining if it is night.
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
Write the converse, inverse, and contrapositive of the following statement.
"If it snows, then they do not drive the car"
Construct the truth table for the following statement pattern.
(p ∨ r) → ~(q ∧ r)
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.
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)
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) ∨ (~ p ∧ q) ≡ (p ∨ q) ∧ ~(p ∧ q)
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)
Write the dual of the following.
p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (q ∨ r)
Write the dual of the following
(p ˄ ∼q) ˅ (∼p ˄ q) ≡ (p ˅ q) ˄ ∼(p ˄ q)
Choose the correct alternative:
If p is any statement, then (p ˅ ~p) is a
Write the dual of the following.
13 is prime number and India is a democratic country
If p → (∼p v q) is false, then the truth values of p and q are respectively
Which of the following is not equivalent to p → q.
Using truth table verify that:
(p ∧ q)∨ ∼ q ≡ p∨ ∼ q
Write the negation of the following statement:
(p `rightarrow` q) ∨ (p `rightarrow` r)
Prepare truth table for the statement pattern `(p -> q) ∨ (q -> p)` and show that it is a tautology.
If p, q are true statements and r, s are false statements, then find the truth value of ∼ [(p ∧ ∼ r) ∨ (∼ q ∨ s)].
