हिंदी

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)


Write the Truth Value of the Negation of the Following Statement :

The Sun sets in the East. 


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


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


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


The statement pattern p ∧ ( q v ~ p) is equivalent to ______.


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


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


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


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


Show that the simplified form of (p ∧ q ∧ ∼ r) ∨ (r ∧ p ∧ q) ∨ (∼ p ∨ q) is q ∨ ∼ p.


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×