English

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

Advertisements
Advertisements

Question

Without using truth table, show that

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

Sum
Advertisements

Solution

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
  Is there an error in this question or solution?
Chapter 1: Mathematical Logic - Exercise 1.9 [Page 22]

APPEARS IN

RELATED QUESTIONS

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


If A = {2, 3, 4, 5, 6}, then which of the following is not true?

(A) ∃ x ∈ A such that x + 3 = 8

(B) ∃ x ∈ A such that x + 2 < 5

(C) ∃ x ∈ A such that x + 2 < 9

(D) ∀ x ∈ A such that x + 6 ≥ 9


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


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


Without using truth table, show that

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


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


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


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


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×