2. Laws of logical connectives example ( Enter your problem )
  1. Laws of logical connectives
  2. Prove Commutative laws
  3. Prove Associative laws
  4. Prove De-Morgan's laws
  5. Prove Distributive laws
  6. Prove Negation law
  7. Prove Absorption laws
  8. Laws for Tautology
  9. Laws for Contradiction
  10. Implication
  11. Double Implication
Other related methods
  1. Definitions of truth table
  2. Laws of logical connectives
  3. Truth table
  4. Valid or invalid argument in logic

6. Prove Negation law
(Previous example)
8. Laws for Tautology
(Next example)

7. Prove Absorption laws





Prove Absorption laws

1. p and (p or q) = p

Solution:
To prove `p^^(pvvq)=p`, we have to first prepare the following truth table


`(1)``(2)``(3)=(1)vv(2)``(4)=(1)^^(3)`
`p``q``pvvq``p^^(pvvq)`
TTTT
TFTT
FTTF
FFFF


from this table, we can say that columns (4) and (1) are identical.
`:. p^^(pvvq)=p`


2. p or (p and q) = p

Solution:
To prove `pvv(p^^q)=p`, we have to first prepare the following truth table


`(1)``(2)``(3)=(1)^^(2)``(4)=(1)vv(3)`
`p``q``p^^q``pvv(p^^q)`
TTTT
TFFT
FTFF
FFFF


from this table, we can say that columns (4) and (1) are identical.
`:. pvv(p^^q)=p`







This material is intended as a summary. Use your textbook for detail explanation.
Any bug, improvement, feedback then Submit Here



6. Prove Negation law
(Previous example)
8. Laws for Tautology
(Next example)





Share this solution or page with your friends.
 
 
Copyright © 2026. All rights reserved. Terms, Privacy
 
 

.