Algebra of Propositional Logic How can I rewrite the following propositions in their simplest equivalent forms 
i.e. Least atomic propositions


*

*$(p \land \neg p) \Rightarrow \neg p$

*$\neg ((p \land\neg p) \Rightarrow \neg q) $

*$\neg ((p \land q) \Rightarrow r)$
Thanks

As $p\land\neg p = \bot$:
$$\bot \to \neg p == \top\lor\neg p == \top$$


*

*$\top$ (simple closed form)

*$\bot$

*$\neg((p\land q)\Rightarrow r)$

