Advertisements
Advertisements
Question
Let p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r). Then, this law is known as ______.
Options
Commutative law
Associative law
De-Morgan's law
Distributive law
Advertisements
Solution
Let p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r). Then, this law is known as distributive law.
APPEARS IN
RELATED QUESTIONS
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 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
Using the rules in logic, write the negation of the following:
(p → q) ∧ r
Without using truth table, show that
p ∧ [(~ p ∨ q) ∨ ~ q] ≡ p
Without using truth table, show that
(p ∨ q) → r ≡ (p → r) ∧ (q → r)
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)
Using the algebra of statement, prove that (p ∨ q) ∧ (~ p ∨ ~ q) ≡ (p ∧ ~ q) ∨ (~ p ∧ q).
(p → q) ∨ p is logically equivalent to ______
The logically equivalent statement of (p ∨ q) ∧ (p ∨ r) is ______
The statement pattern 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
If p ∨ q is true, then the truth value of ∼ p ∧ ∼ q is ______.
Without using truth table, prove that : [(p ∨ q) ∧ ∼p] →q is a tautology.
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
Show that the simplified form of (p ∧ q ∧ ∼ r) ∨ (r ∧ p ∧ q) ∨ (∼ p ∨ q) is q ∨ ∼ p.
