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


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 :

The Sun sets in the East. 


Rewrite the following statement without using if ...... then.

It 2 is a rational number then `sqrt2` is irrational number.


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


Without using truth table, show that

p ↔ q ≡ (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


Using the algebra of statement, prove that

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


Using the algebra of statement, prove that

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


The simplified form of [(~ p v q) ∧ r] v [(p ∧ ~ q) ∧ r] is ______.


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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×