Advertisements
Advertisements
Question
If p ∨ q is true, then the truth value of ∼ p ∧ ∼ q is ______.
Advertisements
Solution
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
RELATED QUESTIONS
The negation of p ∧ (q → r) is ______________.
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
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
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) ∧ ∼(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
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
Without using truth table, show that
(p ∨ q) → r ≡ (p → r) ∧ (q → r)
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 ______.
For any two statements p and q, the negation of the expression (p ∧ ∼q) ∧ ∼p is ______
(p → q) ∨ p is logically equivalent to ______
The logically equivalent statement of (p ∨ q) ∧ (p ∨ r) is ______
The negation of p → (~p ∨ q) is ______
The statement pattern p ∧ (∼p ∧ q) is ______.
The statement pattern [∼r ∧ (p ∨ q) ∧ (p ∨ q) ∧ (∼p ∧ q)] is equivalent to ______
Negation of the Boolean expression `p Leftrightarrow (q \implies p)` is ______.
Without using truth table, prove that : [(p ∨ q) ∧ ∼p] →q is a tautology.
The simplified form of [(~ p v q) ∧ r] v [(p ∧ ~ q) ∧ r] is ______.
Show that the simplified form of (p ∧ q ∧ ∼ r) ∨ (r ∧ p ∧ q) ∨ (∼ p ∨ q) is q ∨ ∼ p.
