0

I need to know how I can prove this question. Prove that not every boolean function is equal to a boolean function constructed by only using And ($\wedge$) and Or ($\vee$)

Alt
  • 2,592
user139632
  • 1

1 Answers1

1

Consider a function $f$ where $f(\text{true}, \text{true}) = \text{false}$. Can you see how any function with this property can't be created with $\land$ and $\lor$?

DanielV
  • 23,556