Advertisements
Advertisements
प्रश्न
If p ∨ q is true, then the truth value of ∼ p ∧ ∼ q is ______.
Advertisements
उत्तर
If p ∨ q is true, then the truth value of ∼ p ∧ ∼ q is False.
Explanation:
⇒ ∼ (p ∨ q) = ∼ p ∧ ∼ q ......[By D'Morgan's law]
∴ ∼ p ∧ ∼ q = ∼ (p ∨ q)
= ∼ (T) = F.
APPEARS IN
संबंधित प्रश्न
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
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 :
The Sun sets in the East.
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
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) ∨ (p ∧ ∼q)
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 ∧ q) → ~ q] ≡ p ∧ q
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
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 ______.
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: ______
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.
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.
