Advertisements
Advertisements
Question
Using the algebra of statement, prove that
[p ∧ (q ∨ r)] ∨ [~ r ∧ ~ q ∧ p] ≡ p
Advertisements
Solution
L.H.S.
= [p ∧ (q ∨ r)] ∨ [~ r ∧ ~ q ∧ p]
≡ [p ∧ (q ∨ r)] ∨ [(~ r ∧ ~ q)∧ p] ...[Associative Law]
≡ [p ∧ (q ∨ r)] ∨ [(~q ∧ ~r) ∧ p] ....[Commutative Law]
≡ [p ∧ (q ∨ r)] ∨ [~ (q ∨ r) ∧ p] ....[De Morgan’s Law]
≡ [p ∧ (q ∨ r)] ∨ [p ∧ ~(q ∨ r)] .....[Commutative Law]
≡ p ∧ [(q ∨ r) ∨ ~(q ∨ r)] ....[Distributive Law]
≡ p ∧ t ......[Complement Law]
≡ p .....[Identity Law]
= R.H.S.
APPEARS IN
RELATED QUESTIONS
The negation of p ∧ (q → r) is ______________.
Without using truth tabic show that ~(p v q)v(~p ∧ q) = ~p
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 :
The Sun sets in the East.
Rewrite the following statement without using if ...... then.
If a man is a judge then he is honest.
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 ∨ 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)
Let p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r). Then, this law is known as ______.
Without using truth table, show that
~ [(p ∧ q) → ~ q] ≡ p ∧ q
The statement pattern p ∧ ( q v ~ p) is equivalent to ______.
(p → q) ∨ p is logically equivalent to ______
The logically equivalent statement of (p ∨ q) ∧ (p ∨ r) is ______
The negation of p → (~p ∨ q) is ______
(p ∧ ∼q) ∧ (∼p ∧ q) is a ______.
The negation of the Boolean expression (r ∧ ∼s) ∨ s is equivalent to: ______
If p ∨ q is true, then the truth value of ∼ p ∧ ∼ q 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.
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
