Advertisements
Advertisements
Question
Without using truth table, show that
p ∧ [(~ p ∨ q) ∨ ~ q] ≡ p
Advertisements
Solution
L.H.S.
≡ p ∧ [(~ p ∨ q) ∨ ~ q]
≡ p ∧ [(~ p ∨ (q ∨ ~ q)] ...[Associative law]
≡ p ∧ (~ p ∨ T) ...[Complement law]
≡ p ∧ T ...[Identity 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 :
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 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).
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
Without using truth table, show that
p ↔ q ≡ (p ∧ q) ∨ (~p ∧ ~q)
Without using truth table, show that
~ [(p ∧ q) → ~ 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 negation of p → (~p ∨ q) is ______
The statement pattern p ∧ (∼p ∧ q) is ______.
(p ∧ ∼q) ∧ (∼p ∧ q) is a ______.
If p ∨ q is true, then the truth value of ∼ p ∧ ∼ q is ______.
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 statement p → (q → p) is equivalent to ______.
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
