Advertisements
Advertisements
Question
Without using truth table, show that
p ↔ q ≡ (p ∧ q) ∨ (~p ∧ ~q)
Advertisements
Solution
L.H.S.
≡ p ↔ q
≡ (p → q) ∧ (q → p)
≡ (~p ∨ q) ∧ (~q ∨ p)
≡ [~ p ∧ (~ q ∨ p)] ∨ [q ∧ (~ q ∨ p)] ....[Distributive law]
≡ [(~ p ∧ ~ q) ∨ (~ p ∧ p)] ∨ [(q ∧ ~ q) ∨ (q ∧ p)] .....[Distributive Law]
≡ [(~ p ∧ ~ q) ∨ F] ∨ [F ∨ (q ∧ p)] ....[Complement Law]
≡ (~ p ∧ ~ q) ∨ (q ∧ p) ....[Identity Law]
≡ (p ∧ q) ∨ (~ p ∧ ~ q) ....[Commutative 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
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.
It f(2) = 0 then f(x) is divisible by (x – 2).
Without using truth table prove that:
(p ∨ q) ∧ (p ∨ ∼ q) ≡ p
Using rules in logic, prove the following:
p ↔ q ≡ ∼(p ∧ ∼q) ∧ ∼(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) ∧ (q ∨ ∼r)
Using the rules in logic, write the negation of the following:
(p → q) ∧ r
Without using truth table, show that
~ [(p ∧ q) → ~ q] ≡ p ∧ q
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)
Using the algebra of statement, prove that
[p ∧ (q ∨ r)] ∨ [~ r ∧ ~ q ∧ p] ≡ p
(p → q) ∨ p is logically equivalent to ______
The logically equivalent statement of (p ∨ q) ∧ (p ∨ r) 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?
∼ ((∼ p) ∧ q) is equal to ______.
Without using truth table, prove that:
[p ∧ (q ∨ r)] ∨ [∼r ∧ ∼q ∧ p] ≡ p
Without using truth table, prove that : [(p ∨ q) ∧ ∼p] →q is a tautology.
Without using truth table prove that
[(p ∧ q ∧ ∼ p) ∨ (∼ p ∧ q ∧ r) ∨ (p ∧ q ∧ r) ∨ (p ∧ ∼ q ∧ r) ≡ (p ∨ q) ∧ r
