हिंदी

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

Advertisements
Advertisements

प्रश्न

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

विकल्प

  • Commutative law

  • Associative law

  • De-Morgan's law

  • Distributive law

MCQ
रिक्त स्थान भरें
Advertisements

उत्तर

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

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 1: Mathematical Logic - Miscellaneous Exercise 1 [पृष्ठ २९]

APPEARS IN

बालभारती Mathematics and Statistics 1 (Commerce) [English] Standard 12 Maharashtra State Board
अध्याय 1 Mathematical Logic
Miscellaneous Exercise 1 | Q 1.03 | पृष्ठ २९

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

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


Without using truth table prove that:

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


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)


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)


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


Without using truth table prove that (p ∧ q) ∨ (∼ p ∧ q) v (p∧ ∼ q) ≡ p ∨ q


Which of the following is not a statement?


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×