This course is about using formal logic to prove theorems in, and therefore learn about, "discrete mathematics". The syllabus is designed in a manner appropriate for Computer Science majors.

Students are expected to have mastered the tools taught in the prerequisite course, MATH1090. 
To be sure, we will review, very  quickly, all the important tools of the " predicate calculus " (also called "first order logic ") that you were taught in MATH 1090 (Ch. 9 of Gries and Schneider---"G+S").

Our aim is to become proficient users of Logic and at the same time knowledgeable in those topics in Discrete Math that your are going to employ in future COSC courses. Thus, while stressing formal techniques in proving theorems, we will not overdo pedantry to the detriment of naturalness and efficiency . (In other words, if you catch me writing pages and pages to prove trivial results, you have every right to stop me :-)

The syllabus will include (from G+S): Review of proofs and proving (Ch. 9), then, Ch. 11, 12, 14, 15. If time permits, we will look into generating functions, a topic that is useful for the COSC core course 3101 (Design and Analysis of Algorithms).

Note: MATH2090 3.0 is a degree program requirement in Computer Science. 
 

Prerequisite: MATH 1090 3.0.
 

Course work and evaluation: There will be 4 to 5 homework assignments worth 40% of the total final grade. 

Note: The homework must be each individual student's own work. While consultations with the instructor, tutor, and amongst students, are part of the learning process and are encouraged, at the end of all this consultation each student will produce an individual report rather than a copy (full or partial) of somebody else's report.

There will also be one Mid-Term (in-class) test worth 20%. Date/Time: October 23, 2003. 10:00am-11:30am.

and a Final Exam worth 40% (date/place/time TBA).

There will be NO make-up tests. Anyone who missed the Mid-Term test and who has satisfactory documentation for "just cause" will have the test weight transferred to the Final Exam. Those who can produce no satisfactory documentation will get a "0" mark for the Mid-Term test.

Text: David Gries and F.B. Schneider, A logical approach to Discrete Math. Springer, latest edition.

Make sure you download:   "A Basic, etc. ... "    and   "The last word on Leibniz?" ( PS and PDF ).