English

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

Advertisements
Advertisements

Question

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

Fill in the Blanks
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.

shaalaa.com
  Is there an error in this question or solution?
2021-2022 (March) Set 1

RELATED QUESTIONS

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


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

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


Using the algebra of statement, prove that

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


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


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


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


Which of the following is not a statement?


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


∼ ((∼ p) ∧ q) is equal 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 simplified form of [(~ p v q) ∧ r] v [(p ∧ ~ q) ∧ r] is ______.


Without using truth table prove that

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


The statement p → (q → p) is equivalent to ______.


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×