Connectives Advanced Quiz 1

1. A set of logical connectives is called functionally complete if it can express all possible what?

2. Which single binary connective is famously known as the Sheffer stroke?

3. Which operator is the dual of the NAND operator under standard Boolean duality?

4. How many distinct binary truth functions can possibly exist for two logical variables?

5. For three variables, how many distinct truth functions can be generated by combinatorics?

6. The formula "P NAND P" is logically equivalent to which unary operator?

7. The formula "P NOR P" is logically equivalent to which unary operator?

8. Expressing "P and Q" using only the NAND operator results in which configuration?

9. Expressing "P or Q" using only the NOR operator results in which configuration?

10. Which property is violated by the conditional operator, proving it lacks standard algebraic grouping equivalence?