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

Using the algebra of statement, prove that [p ∧ (q ∨ r)] ∨ [~ r ∧ ~ q ∧ p] ≡ p - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

Using the algebra of statement, prove that

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

बेरीज
Advertisements

उत्तर

L.H.S.

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

≡ [p ∧ (q ∨ r)] ∨ [(~ r ∧ ~ q)∧ p]     ...[Associative Law]

≡ [p ∧ (q ∨ r)] ∨ [(~q ∧ ~r) ∧ p]       ....[Commutative Law]

≡ [p ∧ (q ∨ r)] ∨ [~ (q ∨ r) ∧ p]         ....[De Morgan’s Law]

≡ [p ∧ (q ∨ r)] ∨ [p ∧ ~(q ∨ r)]          .....[Commutative Law]

≡ p ∧ [(q ∨ r) ∨ ~(q ∨ r)]         ....[Distributive Law]

≡ p ∧ t          ......[Complement Law]

≡ p                .....[Identity Law]

= R.H.S.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 1: Mathematical Logic - Exercise 1.9 [पृष्ठ २२]

APPEARS IN

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

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

Without using truth tabic show that ~(p v q)v(~p ∧ q) = ~p


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


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 rules in logic, prove the following:

∼p ∧ q ≡ (p ∨ 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 ∨ r)


Without using truth table, show that

p ↔ q ≡ (p ∧ q) ∨ (~p ∧ ~q)


Without using truth table, show that

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


For any two statements p and q, the negation of the expression (p ∧ ∼q) ∧ ∼p is ______ 


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


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 ∨ r)] ∨ [∼r ∧ ∼q ∧ p] ≡ p


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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×