This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Massachusetts Institute of Technology 6.042J/18.062J, Spring 11 : Mathematics for Computer Science February 11 Prof. Albert R Meyer revised Saturday 12 th February, 2011, 19:10 Problem Set 2 Due : February 18 Reading: Chapter 3.6 , covering Predicate Formulas , Chapter 4 , covering Sets & Relations , Chapter 5 , covering Infinite Sets . Note: Wednesday lecture will cover Chapter 5.4 & 5.5 , on Russells Paradox & The ZFC Story. This pset does not cover Chapter 5.1 5.3 , on Cardinality & the Halting Problem, but these sections are due for Friday lecture, Feb. 18. Reminder : Email comments on the reading are due before the class in which the reading is covered. Latest times for comments on different sections are indicated in the online tutor problem set TP.3. Reading Comments count for 3% of the final grade. Problem 1. Translate the following sentence into a predicate formula: There is a student who has emailed exactly two other people in the class, besides possibly herself. The domain of discourse should be the set of students in the class; in addition, the only predicates that you may use are equality, and E.x;y/ , meaning that x has sent email to y . Problem 2....
View Full
Document
 Spring '11
 Leighton
 Computer Science

Click to edit the document details