मराठी
महाराष्ट्र राज्य शिक्षण मंडळएचएससी वाणिज्य (इंग्रजी माध्यम) इयत्ता १२ वी

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

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


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 : 

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


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)


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


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 ______ 


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


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


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


Which of the following is not a statement?


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


Without using truth table, prove that:

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


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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×