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
Without using truth tabic show that ~(p v q)v(~p ∧ q) = ~p
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
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.
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)
Without using truth table, show that
p ∧ [(~ p ∨ q) ∨ ~ q] ≡ p
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)
The statement pattern p ∧ ( q v ~ p) is equivalent to ______.
For any two statements p and q, the negation of the expression (p ∧ ∼q) ∧ ∼p is ______
The negation of p → (~p ∨ q) 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 logical statement [∼(q ∨ ∼r) ∨ (p ∧ r)] ∧ (q ∨ p) is equivalent to: ______
Which of the following is not a statement?
Negation of the Boolean expression `p Leftrightarrow (q \implies p)` is ______.
Without using truth table, prove that:
[p ∧ (q ∨ r)] ∨ [∼r ∧ ∼q ∧ p] ≡ p
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
