Advertisements
Advertisements
प्रश्न
Using the algebra of statement, prove that
(p ∧ q) ∨ (p ∧ ~ q) ∨ (~ p ∧ ~ q) ≡ (p ∨ ~ q)
उत्तर
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 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
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.
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) ≡ ∼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) ∧ r
Using the rules in logic, write the negation of the following:
(∼p ∧ q) ∨ (p ∧ ∼q)
Without using truth table, show that
p ↔ q ≡ (p ∧ q) ∨ (~p ∧ ~q)
Without using truth table, show that
~ [(p ∧ q) → ~ q] ≡ p ∧ q
Without using truth table, show that
~r → ~ (p ∧ q) ≡ [~ (q → r)] → ~ p
Using the algebra of statement, prove that
[p ∧ (q ∨ r)] ∨ [~ r ∧ ~ q ∧ p] ≡ 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 negation of p → (~p ∨ q) is ______
The negation of the Boolean expression (r ∧ ∼s) ∨ s is equivalent to: ______
The logical statement [∼(q ∨ ∼r) ∨ (p ∧ r)] ∧ (q ∨ p) 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?
Negation of the Boolean expression `p Leftrightarrow (q \implies p)` is ______.
∼ ((∼ p) ∧ q) is equal to ______.
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
