(a) Show that every propositional formula is equivalent to one using the connectives $\to$ and $\neg$.
(b) Show the same is true for the Sheffer stroke $|$ where $p\mid q$ means "either not $p$ or not $q$" or "not both $p$ and $q$".
(a) Show that every propositional formula is equivalent to one using the connectives $\to$ and $\neg$.
(b) Show the same is true for the Sheffer stroke $|$ where $p\mid q$ means "either not $p$ or not $q$" or "not both $p$ and $q$".