Reading for Monday, September 14:

• Grimaldi:  1.2
• One of the two NYT articles on MC36 webpage

• Grimaldi, Section 1.1/1.2 (starting on page 12):  13,15,17,27  (for practice, not to turn in)
• Write a paragraph in which you state your initial position on the question of whether computers can prove theorems.  Include one argument from the article you read which either supports or challenges your initial position.  What do you believe now?  One paragraph is sufficient.  It may be handwritten, typed or e-mailed to me.  If you e-mail me your writing, make sure that you proofread it carefully before sending it.  (turn in/submit Monday)

• Grimaldi:  1.3

• Grimaldi:  1.3  #7,25,31

• Grimaldi:  1.4

• Grimaldi:  2.1
• Pay particular attention to Example 2.2.  Express p ->q as an English sentence.  Use this expression to explain why p->q is true when p is false and q is true (row 2 of Table 2.2)
• How many rows are there in a truth table for a compound statement  made up of two primitive statements?  What if there are n primitive statements?
• What kind of statment is p /\ ~p?  p\/~p ?