Mathematics Projects
Discrete Mathematics

Functionally Complete Sets. TeX version and Postscript version.
Project contributed by Neal Brand.
This project requires students to prove that any compound proposition is logically equivalent to a compound proposition using only NAND and furthermore, it is logically equivalent to a compound propostion using only NOR. Students are then required to show that any way of assigning truth values in a truth table is realized by a compound proposition using the usual logical operators.
Project teaches and provides practice in:
- Truth tables
- Logically equivalent propositions
- Proof by induction