INTRODUCTION TO PROOF: HOMEWORK 3

DUE THURSDAY, FEBRUARY 4TH AT THE BEGINNING OF CLASS

You may work on homework together, but you must write up your solutions individually
and write the names of the individuals with whom you worked. For full credit, show all work
and explain your work as described on the syllabus. If you use any materials outside of the
course materials, e.g., the internet or a different book, make sure to provide a short citation.

(1) (5 pts) Let x, y, and z be Boolean variables. Prove that (x y) z is logically

equivalent to (x z) (y z).
(2) (5 pts each) A contradiction is a Boolean expression that evaluates to False for all
possible values of its variables. Let x, y, and z be Boolean variables. Prove that the
following are contradictions.
(a) (x y) (x y) (x)
(b) x (x y) (y)
(c) (x y) ((x) y) (y).
(3) (a) (5 pts) Find a Boolean expression that is logically equivalent to x y and uses
only , , and , and prove that your expression is equivalent.
(b) (5 pts) Find a Boolean expression that is logically equivalent to x y and uses
only and , and prove that your expression is equivalent.