Advertisements
Advertisements
Question
Without using truth table, show that
~r → ~ (p ∧ q) ≡ [~ (q → r)] → ~ p
Advertisements
Solution
L.H.S.
≡ ~r → ~ (p ∧ q)
≡ ~(~ r) ∨ ~ (p ∧ q) ....[p → q ≡ ~ p ∨ q]
≡ r ∨ ~(p ∧ q) ....[Negation of negation]
≡ r ∨ (~p ∨ ~q) ....[De Morgan’s law]
≡ ~p ∨ (~q ∨ r) .....[Commutative and associative law]
≡ ~p ∨ (q → r) ....[p → q ≡ ~ p ∨ q]
≡ (q → r) ∨ ~p ......[Commutative law]
≡ ~[~ (q → r)] ∨ ~ p ......[Negation of negation]
≡ [~ (q → r)] → ~ p .....[p → q ≡ ~ p ∨ q]
= R.H.S.
APPEARS IN
RELATED QUESTIONS
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
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 the rules in logic, write the negation of the following:
p ∧ (q ∨ r)
Let p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r). Then, this law is known as ______.
Without using truth table, show that
p ↔ q ≡ (p ∧ q) ∨ (~p ∧ ~q)
Without using truth table, show that
p ∧ [(~ p ∨ q) ∨ ~ q] ≡ p
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)
The statement pattern p ∧ ( q v ~ p) is equivalent to ______.
The negation of p → (~p ∨ q) is ______
The statement pattern p ∧ (∼p ∧ q) is ______.
(p ∧ ∼q) ∧ (∼p ∧ q) is a ______.
The negation of the Boolean expression (r ∧ ∼s) ∨ s is equivalent to: ______
Which of the following is not a statement?
∼ ((∼ p) ∧ q) is equal to ______.
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
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
