Home | | Schedule | | Assignments | | Lecture Notes
Due: Wednesday, February 27 in class.
Complete the following problems in chapter 4 of your text:
4.3
4.10 (Use p as a fact and (p implies q) as a fact.)
4.12
4.14
Note that all cases will be of the form b <= c <= d, with the order of b, c and d
changing in each case. Write down all possible cases, e.g. all orderings of b, c, and d.
Prove associativity for each case (the proofs will all be very similar to one another).
Constance Royden--croyden@mathcs.holycross.edu
Computer Science 135--Discrete Structures
Last Modified: February 19, 2013
Page Expires: January 8, 2014