In: Computer Science
Use the laws of propositional logic to prove that the following compound propositions are logically equivalent.
A. ? ↔ (? ∧ ?) and ? → ?
B. ¬(? ∨ (? ∧ (? → ?))) and ¬? ∧ (? → ?)
Answer to the above question as follows-
During the proof we will be using some of the Boolean Algebra Laws, which can be stated as -
Idempotent law - 

Complement Law - 

De Morgan's Law - 
  
Distributive law - 
  
Absorption Law - 

The solution for the equality of above two given expressions are -

  
For Question 2 we have

