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

Without using truth table, show that p ∧ [(~ p ∨ q) ∨ ~ q] ≡ p

Advertisements
Advertisements

प्रश्न

Without using truth table, show that

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

बेरीज
Advertisements

उत्तर

L.H.S.

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

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

≡ p ∧ (~ p ∨ T)       ...[Complement law]

≡ p ∧ T       ...[Identity 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 1.2 | पृष्ठ २२

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

The negation of p ∧ (q → r) is ______________.


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)


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 


Without using truth table prove that:

(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


Using the rules in logic, write the negation of the following:

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


Without using truth table, show that

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


Without using truth table, show that

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


Without using truth table, show that

(p ∨ q) → r ≡ (p → r) ∧ (q → r)


Using the algebra of statement, prove that

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


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


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


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


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


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


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


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


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


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


Without using truth table, prove that:

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


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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×