Monday, 1/7	Intro to the course. Propositional logic.
Wednesday, 1/9	More propositional logic. Reading: Skim Chapter 1, so that you can go back to it later when you get stuck on a problem. Read Sections 2.1 and Section 2.2 up to the part on the real numbers.
Friday, 1/11	Sets. Reading: Re-read Section 2.2 Homework 1 due: Section 2.1, #1ae, 6a, 11, 12, 14, 16, 19.
Monday, 1/14	Predicates and Quantifiers. Reading: Section 2.3.
Wednesday, 1/16	More on predicates and quantifiers. Direct proofs. Homework 2 due: Section 2.2 (p.45), #4abe, 5, 9, 12a, 13, 14, 16. Section 2.3 (p. 51), #2, 6, 7, 11, 13, 14, 16, 18, 21.
Friday, 1/18	Indirect proofs (contrapositive and contradiction). Read: Section 3.1, as much of Section 3.2 as you can.
Monday, 1/21	Mathematical Induction. Read: Section 3.3, up to the part on strong induction. Homework 3 due: Section 2.3 (p. 51), #27bcg. Section 3.1 (p. 60), #12, 18. Section 3.2 (p. 66), #1, 5a, 7, 9, 14.
Wednesday, 1/23	More on induction, including strong induction. Read: The part of section 3.3 on strong induction.
Friday, 1/25	Case analysis and proof strategy. Sets revisited. Read through Sections 3.5 and 3.6. Some nice proofs are discussed. Homework 4 due: Section 3.1 (p. 60), #7, 13. Section 3.2 (p. 66), #13. Section 3.3 (p. 75), #2, 5, 12, 14, 16, 18b, 20 and the problems on this sheet.
Monday, 1/28	Sets and power sets. Read: Section 4.1.
Wednesday, 1/30	Cartesian products. Relations. (Section 4.2) Read: take another look at pages 109-114. Homework 5 due: Section 3.4 (pp. 82-83) #4, 8, 10. Section 4.1 (pp. 114-116), #3ef, 4ce, 7ab, 8a, 9, 11abc, 12, 19, 22bcd.
Friday, 2/1	More on relations. (Section 4.2) Read: pages 117-130.
Monday, 2/4	More on relations (Section 4.2) Homework 6 due: Section 4.2 (pp. 130-132), #3abcdf, #4ab, 6ab, 8c, 12bcef.
Wednesday, 2/6	Functions (Section 4.3)
Friday, 2/8	In-class exam
Monday, 2/11	No class -- mid-term break.
Wednesday, 2/13	More on Functions (4.3) Read: pages 132-147. Homework 7 due: Section 4.2 (pp. 130-132), #15bcg, 19abc, 21, 24a, 29. Section 4.3 (pp. 150-153), #1bcef, 2abcde, 12 (for #2, you don't have to give formal proofs, but give counterexamples or brief explanations).
Friday, 2/15	Still more on functions (4.3)
Monday, 2/18	Equivalence relations (4.4). Homework 8 (group homework) due: Section 4.3 (pp. 150-153), #4bd, 5, 13, 14 (your salvages, if any, should involve replacing equals with some other symbol), 16 ("the second statement in Theorem 2" means "the converse in Theorem 2"), 17a(iv), 19, 20, 24, 25a (hint: if C is an element of P(A), what should F(C) be?) , 27 (for part c, remember that "one-to-one correspondence" means bijection), 31.
Wednesday, 2/20	No class
Friday, 2/22	More on equivalence relations (4.4) Read: Section 4.4.
Monday, 2/25	Wrap up equivalence relations (4.4). Take-home midterm handed out HW 9 due: Section 4.4 (pp. 166-168), #6 (give justifications), 8, 11ab, 13, 16, 32, and the problems on this sheet.
Wednesday, 2/27	Equinumerous sets and the Hilbert Hotel (5.1)
Friday, 3/1	More equinumerous sets (5.1) Take-home midterm due
Monday, 3/4	Finite sets and the pigeonhole principle (5.2) Read: Section 5.2.
Wednesday, 3/6	Finite sets and the pigeonhole principle (5.2). Homework 10 due: Section 4.4 (pp. 166-168), #23, 29ab, 36. Section 5.1 (pp. 200-201), #2ad, 3ab, 7, 15 (Hint: one method for part a) is to use Theorem 2).
Friday, 3/8	Denumerable Sets (5.3) Read: Section 5.3
Monday, 3/11	Uncountable Sets (Section 5.4) Read: Section 5.4. Homework 11 (group homework) due: Section 5.2 (pp. 207-208), #2, 6abc (you do not need to prove your conjectures), 10, 11, 13, 14, 15. Section 5.3 (pp. 215-216), #2, 4c, 8, 15, 16.
Wednesday, 3/13	More on Uncountable Sets (Section 5.4) Homework 12 due: Section 5.4 (p. 222), #3c, 4, 5, 11 (Hint: one method is to assume the set is countable, then use #5 and Theorem 1 on page 209). Final exam handed out
Monday, 3/18	Final exam due, 5 pm