हिंदी

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

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

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 : 

cos2 θ + sin2 θ = 1, for all θ ∈ R 


Rewrite the following statement without using if ...... then.

It 2 is a rational number then `sqrt2` is irrational number.


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 ∨ ∼ 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) ∧ r


Without using truth table, show that

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


Without using truth table, show that

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


Using the algebra of statement, prove that

[p ∧ (q ∨ r)] ∨ [~ r ∧ ~ q ∧ p] ≡ p


The statement pattern p ∧ ( q v ~ p) is equivalent to ______.


(p → q) ∨ p is logically equivalent to ______ 


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


The statement pattern p ∧ (∼p ∧ q) is ______.


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


∼ ((∼ p) ∧ q) is equal to ______.


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.


The logically equivalent statement of \[\left(\sim p\wedge q\right)\vee\left(\sim p\wedge\sim q\right)\] \[\vee\left(\ p\wedge\sim q\right)\] is


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×