Advertisements
Advertisements
प्रश्न
Using the algebra of statement, prove that
(p ∧ q) ∨ (p ∧ ~ q) ∨ (~ p ∧ ~ q) ≡ (p ∨ ~ q)
Advertisements
उत्तर
L.H.S.
= (p ∧ q) ∨ (p ∧ ~ q) ∨ (~ p ∧ ~ q)
≡ (p ∧ q) ∨ [(p ∧ ~ q) ∨ (~ p ∧ ~ q)] ....[Associative Law]
≡ (p ∧ q) ∨ [(~q ∧ p) ∨ (~ q ∧ ~ p)] ....[Commutative Law]
≡ (p ∧ q) ∨ [~q ∧ (p ∨ ~ p)] ....[Distributive Law]
≡ (p ∧ q) ∨ (~q ∧ t) .....[Complement Law]
≡ (p ∧ q) ∨ (~q) .....[Identity Law]
≡ (p ∨ ~ q) ∧ (q ∨ ~q) .....[Distributive Law]
≡ (p ∨ ~ q) ∧ t ....[Complement Law]
≡ p ∨ ~ q .....[Identity Law]
= R.H.S.
APPEARS IN
संबंधित प्रश्न
The negation of p ∧ (q → r) is ______________.
Without using truth tabic show that ~(p v q)v(~p ∧ q) = ~p
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 :
The Sun sets in the East.
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 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).
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) ∧ ∼p
Using rules in logic, prove the following:
∼ (p ∨ q) ∨ (∼p ∧ q) ≡ ∼p
Let p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r). Then, this law is known as ______.
Without using truth table, show that
p ↔ q ≡ (p ∧ q) ∨ (~p ∧ ~q)
Without using truth table, show that
~r → ~ (p ∧ q) ≡ [~ (q → r)] → ~ p
The statement pattern p ∧ ( q v ~ p) is equivalent to ______.
The logically equivalent statement of (p ∨ q) ∧ (p ∨ r) is ______
The statement pattern p ∧ (∼p ∧ q) is ______.
(p ∧ ∼q) ∧ (∼p ∧ q) is a ______.
Negation of the Boolean expression `p Leftrightarrow (q \implies p)` is ______.
Without using truth table, prove that : [(p ∨ q) ∧ ∼p] →q is a tautology.
The statement p → (q → p) is equivalent to ______.
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
