Our main goal will be concrete computations rather than only proofs. In place of a final, I am requiring either a paper or a project. More about this in class. Quizzes will not be announced in advance and no make ups are permitted, but I will use the best five quiz grades to give everyone the benefit of the doubt. For example, a set with three elements is said to contain three bits of information since each element can either be present or not in a subset.
Bits corresponding to an n-tuple of variables determine a cube.
Two vertices are adjacent if they are identical except for exactly one coordinate. So each vertex will have exactly n neighbors. For n greater than 3, the resulting structure is called a hypercube. So the cube is also called the Boolean cube. Indeed, the idea of Boolean logic is clearly present in Aristotle's writing, and the student may have encountered it also in so-called Venn diagrams.