Advertisements
Advertisements
प्रश्न
Without using truth table, show that
p ↔ q ≡ (p ∧ q) ∨ (~p ∧ ~q)
Advertisements
उत्तर
L.H.S.
≡ p ↔ q
≡ (p → q) ∧ (q → p)
≡ (~p ∨ q) ∧ (~q ∨ p)
≡ [~ p ∧ (~ q ∨ p)] ∨ [q ∧ (~ q ∨ p)] ....[Distributive law]
≡ [(~ p ∧ ~ q) ∨ (~ p ∧ p)] ∨ [(q ∧ ~ q) ∨ (q ∧ p)] .....[Distributive Law]
≡ [(~ p ∧ ~ q) ∨ F] ∨ [F ∨ (q ∧ p)] ....[Complement Law]
≡ (~ p ∧ ~ q) ∨ (q ∧ p) ....[Identity Law]
≡ (p ∧ q) ∨ (~ p ∧ ~ q) ....[Commutative Law]
≡ R.H.S.
APPEARS IN
संबंधित प्रश्न
Without using the truth table show that P ↔ q ≡ (p ∧ q) ∨ (~ p ∧ ~ q)
If A = {2, 3, 4, 5, 6}, then which of the following is not true?
(A) ∃ x ∈ A such that x + 3 = 8
(B) ∃ x ∈ A such that x + 2 < 5
(C) ∃ x ∈ A such that x + 2 < 9
(D) ∀ x ∈ A such that x + 6 ≥ 9
Write the truth value of the negation of the following statement :
cos2 θ + sin2 θ = 1, for all θ ∈ R
Rewrite the following statement without using if ...... then.
It f(2) = 0 then f(x) is divisible by (x – 2).
Without using truth table prove that:
(p ∨ q) ∧ (p ∨ ∼ q) ≡ p
Without using truth table prove that:
∼ [(p ∨ ∼ q) → (p ∧ ∼ q)] ≡ (p ∨ ∼ q) ∧ (∼ p ∨ q)
Using rules in logic, prove the following:
p ↔ q ≡ ∼(p ∧ ∼q) ∧ ∼(q ∧ ∼p)
Using rules in logic, prove the following:
∼p ∧ q ≡ (p ∨ q) ∧ ∼p
Using the rules in logic, write the negation of the following:
(p ∨ q) ∧ (q ∨ ∼r)
Using the rules in logic, write the negation of the following:
(p → q) ∧ r
Using the rules in logic, write the negation of the following:
(∼p ∧ q) ∨ (p ∧ ∼q)
Without using truth table, show that
p ∧ [(~ p ∨ q) ∨ ~ q] ≡ p
Using the algebra of statement, prove that (p ∨ q) ∧ (~ p ∨ ~ q) ≡ (p ∧ ~ q) ∨ (~ p ∧ q).
For any two statements p and q, the negation of the expression (p ∧ ∼q) ∧ ∼p is ______
The logically equivalent statement of (p ∨ q) ∧ (p ∨ r) is ______
The negation of p → (~p ∨ q) is ______
The statement pattern p ∧ (∼p ∧ q) is ______.
The statement pattern [∼r ∧ (p ∨ q) ∧ (p ∨ q) ∧ (∼p ∧ q)] is equivalent to ______
The negation of the Boolean expression (r ∧ ∼s) ∨ s is equivalent to: ______
Without using truth table prove that (p ∧ q) ∨ (∼ p ∧ q) v (p∧ ∼ q) ≡ p ∨ q
Which of the following is not a statement?
Without using truth table, prove that:
[p ∧ (q ∨ r)] ∨ [∼r ∧ ∼q ∧ p] ≡ p
The simplified form of [(~ p v q) ∧ r] v [(p ∧ ~ q) ∧ r] is ______.
Without using truth table prove that
[(p ∧ q ∧ ∼ p) ∨ (∼ p ∧ q ∧ r) ∨ (p ∧ q ∧ r) ∨ (p ∧ ∼ q ∧ r) ≡ (p ∨ q) ∧ r
