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
संबंधित प्रश्न
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
Rewrite the following statement without using if ...... then.
If a man is a judge then he is honest.
Without using truth table prove that:
∼ [(p ∨ ∼ q) → (p ∧ ∼ q)] ≡ (p ∨ ∼ q) ∧ (∼ p ∨ q)
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 ∧ [(~ p ∨ q) ∨ ~ q] ≡ 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 ______
(p ∧ ∼q) ∧ (∼p ∧ q) is a ______.
The negation of the Boolean expression (r ∧ ∼s) ∨ s is equivalent to: ______
If p ∨ q is true, then the truth value of ∼ p ∧ ∼ q is ______.
∼ ((∼ p) ∧ q) is equal to ______.
Show that the simplified form of (p ∧ q ∧ ∼ r) ∨ (r ∧ p ∧ q) ∨ (∼ p ∨ q) is q ∨ ∼ p.
