Boolean basis complete?

57 Views Asked by At

Check, whether boolean basis consisting of $\{\lor, \rightarrow \}$ is complete one?

1

There are 1 best solutions below

0
On BEST ANSWER

It is not complete. In particular, you can't construct $\neg$, since:

$$\mathrm{T}\lor\mathrm{T} = \mathrm{T} \rightarrow \mathrm{T} = \mathrm{T}$$

So there is no way of combining $\lor$ and $\rightarrow$ that will turn $\mathrm{T}$ into $\mathrm{F}$. This is the same reason $\left(\land,\rightarrow\right)$ is incomplete, as shown in the question you linked to.