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
संबंधित प्रश्न
Using the rules of negation, write the negatlon of the following:
(a) p ∧ (q → r)
(b) ~P ∨ ~q
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.
If a man is a judge then he is honest.
Rewrite the following statement without using if ...... then.
It 2 is a rational number then `sqrt2` is irrational number.
Rewrite the following statement without using if ...... then.
It f(2) = 0 then f(x) is divisible by (x – 2).
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) ∧ r
Without using truth table, show that
~ [(p ∧ q) → ~ q] ≡ p ∧ q
Without using truth table, show that
~r → ~ (p ∧ q) ≡ [~ (q → r)] → ~ p
Without using truth table, show that
(p ∨ q) → r ≡ (p → r) ∧ (q → r)
Using the algebra of statement, prove that
(p ∧ q) ∨ (p ∧ ~ q) ∨ (~ p ∧ ~ q) ≡ (p ∨ ~ q)
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 statement pattern p ∧ (∼p ∧ q) is ______.
The statement pattern [∼r ∧ (p ∨ q) ∧ (p ∨ q) ∧ (∼p ∧ q)] is equivalent to ______
(p ∧ ∼q) ∧ (∼p ∧ q) is a ______.
The negation of the Boolean expression (r ∧ ∼s) ∨ s is equivalent to: ______
Which of the following is not a statement?
∼ ((∼ p) ∧ q) is equal to ______.
Without using truth table, prove that:
[p ∧ (q ∨ r)] ∨ [∼r ∧ ∼q ∧ p] ≡ p
Show that the simplified form of (p ∧ q ∧ ∼ r) ∨ (r ∧ p ∧ q) ∨ (∼ p ∨ q) is q ∨ ∼ p.
The logically equivalent statement of \[\left(\sim p\wedge q\right)\vee\left(\sim p\wedge\sim q\right)\] \[\vee\left(\ p\wedge\sim q\right)\] is
