Boolean logic --> Convert And to Or

Question

To convert an AND into an XOR, I can do:

AND(NOT(AND(A,B)), NOT(AND(NOT(A), NOT(B))))

$$\neg(A∧B)∧\neg (\neg A∧ \neg B)$$

How could I convert an AND into an OR with the constraint that I only use the AND and NOT logical operators?

Answer 1

Via De Morgan,

$$A \vee B = \neg(\neg A ∧ \neg B)$$

Edit: To be more explicit, using the De Morgan law $ \neg(p \vee q) = \neg p ∧ \neg q$, set $p = \neg A$, and $q = \neg B$. Note that $\neg p = A$, and $ \neg q = B$. Then, we get

$$A \vee B = \neg p \vee \neg q \overset{DM}= \neg (p ∧ q) = \neg (\neg A ∧ \neg B) $$

Or, if you prefer it without a change of varible,

$$ \neg(\neg A ∧ \neg B) = \neg((\neg A) ∧ (\neg B)) \overset{DM}= \neg(\neg A) \vee \neg(\neg B) = A \vee B$$