Suppose I have a statement made of many propositions.
$\left(a \rightarrow b\right) \wedge \left(c \oplus d\right) \vee \left(e\wedge f\right) \dots$
composed of the standard 16 binary operators. Is there a way to know how many truths there will be in the truth table? That doesn't involve putting all combinations of 1 and 0 in to evaluate them?
Thanks in advance for any help.