Math 210 Fall 2006

Exam 1 review

The first hour exam will be on Friday, Sept. 22, in class, and will cover sections 1.1 – 3.1 of our textbook.

Some preliminary notes:

• I have attempted to be comprehensive in the following, but you are responsible for the material covered, even if I do forget to list something here.  If you do find an omission, please do let me know.

• This is a draft and is subject to revision on Monday

In your review, look at definitions, homework problems assigned, and bits of history.  In particular:

• Be able to give a definition of terms encountered so far (proposition, predicate, functions, composition, and the like).

• Be able to produce and interpret truth tables

• Be able to say what is sufficient, necessary; what is the converse and contrapositive of a conditional statement.

• Be able to translate logical expressions into English and English expressions into logic.

• Know the basic identities for logical expressions (including quantifiers)

• Be able to construct proofs, giving reasons for each step.

• Be able to produce intersections, unions, differences, and Cartesian products of sets.

• Be able to construct proofs about sets.

• Be able to say what an algorithm is and give some examples and near misses (a near miss would be something which is almost an algorithm but fails to be for some reason)

• Know definitions.

• Review bibliographies (from the text).  I will give you a list of names coming from the reading so far and ask you to briefly describe who one or two of them are and what they did relevant to this course.