boolean-functions

Given the function $$F = P′ + QR,$$ where $$F$$ is a function in three Boolean variables $$P,Q$$ and $$R$$ and $$P'=!P,$$ consider the following statements. $$\eqalign{ & \,\,\,\,\...

The dual of a Boolean function $$F\left( {{x_1},{x_2},\,....,\,{x_n},\, + , \cdot ,'} \right),$$ written as $${F^D}$$, is the same expression as that of $$F$$ with $$+$$ and $$ \cd...

What is the maximum number of different Boolean functions involving $$n$$ Boolean variables?

Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function?