हिंदी

If p ∨ q is true, then the truth value of ∼ p ∧ ∼ q is ______. - Mathematics and Statistics

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.

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
2021-2022 (March) Set 1

संबंधित प्रश्न

The negation of p ∧ (q → r) is ______________.


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)


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.


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 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)


Let p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r). Then, this law is known as ______.


Without using truth table, show that

~ [(p ∧ q) → ~ q] ≡ p ∧ q


Without using truth table, show that

~r → ~ (p ∧ q) ≡ [~ (q → r)] → ~ 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)


Using the algebra of statement, prove that (p ∨ q) ∧ (~ p ∨ ~ q) ≡ (p ∧ ~ q) ∨ (~ p ∧ q).


The logically equivalent statement of (p ∨ q) ∧ (p ∨ r) is ______ 


The negation of p → (~p ∨ q) is ______ 


The statement pattern [∼r ∧ (p ∨ q) ∧ (p ∨ q) ∧ (∼p ∧ q)] is equivalent to ______ 


(p ∧ ∼q) ∧ (∼p ∧ q) is a ______.


The negation of the Boolean expression (r ∧ ∼s) ∨ s is equivalent to: ______ 


The logical statement [∼(q ∨ ∼r) ∨ (p ∧ r)] ∧ (q ∨ p) is equivalent to: ______ 


Negation of the Boolean expression `p Leftrightarrow (q \implies p)` is ______. 


The simplified form of [(~ p v q) ∧ r] v [(p ∧ ~ q) ∧ r] is ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×