Introduction to Advanced Mathematics by William J Barnier, Norman Feldman Prentice Hall, 2000 This book has the core material of the course presented in a good way -- although it presents material in a slightly less formal way than we will do in this course.

Discrete Mathematics and its Applications   by Kenneth H. Rosen, McGraw Hill, 2003 This is the most widely used text for this course and is a suitable reference for about half the course.

Abstract: This course serves to introduce the mathematical concepts that serve as the foundations of computer science: basic set theory, the theory of relations and functions, graphs (directed and undirected), Boolean algebra, propositional and first order logic, inductively defined structures (lists and trees), and applications of mathematical induction. This course provides an introduction to the abstract and rigorous thinking that is required in other areas of mathematics and computer science. By the end of the course, students will have learned how to recognize a mathematical proof and will know how to produce their own.

Grading and Other Policies: Grades will be based on written homework, an in-class midterm exam and a final exam. A standard grading scale will be used, where an overall average of 90%-100% earns an A, 80%-89% a B, 70%-79% a C, 60%-69% a D and 0%-59% an F. Work is due at the beginning of class, and late work is accepted for a few days, or until a solution is distributed, at a substantial reduction in credit each day. Returned work should be kept for verification of records.

The professor reserves the right to alter the grading scheme or to take extenuating circumstances into account when assigning grades. Discussion of the course material among students is encouraged, although students are expected to write up their own homeworks. Academic dishonesty will be treated in accordance with university standards. Students are urged to read University regulation 802 , section 3 defines academic dishonesty. University regulation 203 describes students rights to appeal and the appeal process.

Homework:

No.	Due Date	Assignment	Remarks
1	Thursday: January 11	hw1.pdf	Wed Aug 29 12:16:24 MDT 2007: Fixed assignment to match page numbering in the latest version of the lecture notes.
2	Tuesday: September 4	hw2.pdf
3	Thursday: September 6	hw3.pdf
4	Tuesday: September 11	hw4.pdf
5	Thursday: September 13	hw5.pdf	propositional proof rules
6	Tuesday: September 18	hw6.pdf	propositional proof rules
7	Thursday: September 20	hw7.pdf
8	Thursday: September 27	hw8.pdf	Here's the HW that should have been due Tuesday.
9	Thursday: September 27	hw9.pdf	Here are the proof rules.
10	Tuesday: October 2	hw10.pdf	Here are the rules for translating a sequent proof into English.
11	Thursday: October 4	hw11.pdf	Read ahead in the set theory section of the lecture notes.
12	Tuesday: October 9	hw12.pdf
13	Thursday: October 11	hw13.pdf
14	Tuesday: October 16	hw14.pdf	Remember -- Midterm review on Tuesday -- come with questions.
15	Thursday: October 25	hw15.pdf
16	Tuesday: October 30	hw16.pdf	This is a harder assignment -- don;t wait until the last minute.
17	Thursday: Nov 1	hw17.pdf
18	Thursday: November 8	hw18.pdf
19	Tuesday: April 5	hw19.pdf
20	Tuesday: November 20	hw20.pdf	Try to do this carefully, step by step and it's really not that difficult. Five hints added to the HW text at 2:32 PM on Wednesday afternoon.
21	Thursday: November 29	hw21.pdf
22	Tuesday: December 4	hw22.pdf	Last one!!

Exams:

• Midterm Exam: 6 March 2007 (in class)
• Final Exam Tuesday, Dec 11, 2007 from 1:15 -- 3:15 in EN 3106
  

Miscellaneous Resources:

• Notes for Discrete Mathematics (pdf)
• Chapter 1 of Hein (pdf) (postscript) See the Errata for a problem in chapter 1, page 14.
• Chapter 2 of Hein (pdf) (postscript)
• Chapter 3 of Hein (pdf) (postscript)