Advertisements
Advertisements
प्रश्न
Using the rules of negation, write the negatlon of the following:
(a) p ∧ (q → r)
(b) ~P ∨ ~q
Advertisements
उत्तर
(a) p ∧ (q → r)
~[p ∧ ~ (q → r)]
≡ ~ p ∨ ~ (q → r )
≡ ~ p ∨ ~ (q ∧ ~ r )
(b) ~P ∨ ~q
~[~p ∨ ~q]
≡ ~(~p) ∧ ~(~q)
≡ P ∧ q
APPEARS IN
संबंधित प्रश्न
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.
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) ∨ (p ∧ ∼q)
Without using truth table, show that
p ↔ q ≡ (p ∧ q) ∨ (~p ∧ ~q)
Without using truth table, show that
~r → ~ (p ∧ q) ≡ [~ (q → r)] → ~ p
For any two statements p and q, the negation of the expression (p ∧ ∼q) ∧ ∼p is ______
(p → q) ∨ p is logically equivalent to ______
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: ______
Without using truth table prove that (p ∧ q) ∨ (∼ p ∧ q) v (p∧ ∼ q) ≡ p ∨ q
Which of the following is not a statement?
Without using truth table, prove that : [(p ∨ q) ∧ ∼p] →q is a tautology.
The statement p → (q → p) is equivalent to ______.
