1. (14) List the elements for each of the following sets:

(1) P({a, b, c})                                                         (Note: P refers to power set)

(2)   P{a, b}) - P({a, c})

(3)   P(Æ)

(4) {x Î ?: (x £ 7 Ù x ³ 7}                        (Note: ? is the set of nonnegative integers)

(5)   {x Î ?: $y Î ? (y < 10 Ù (y + 2 = x))}           

(6)    {x Î ?: $y Î ? ($z Î ? ((x = y + z) Ù (y < 5) Ù (z < 4)))}

(7)   {a, b, c} x {c, d}                                                 (Note: x refers to Cartesian product)

2. (12) True or False.

Let R = {(1, 2), (2, 3), (1, 1), (2, 2), (3, 3), (1, 3)}.

(1) R is reflexive.

(2) R is transitive.

(3) R is symmetric.

(4) R is antisymmetric.

 

3. (16) True or False.

 

(1) Subset-of is a partial order defined on the set of all sets.

(2) Subset-of is a total order defined on the set of all sets.

(3) Proper-subset-of is a partial order defined on the set of all sets.

(4) Proper-subset-of is a total order defined on the set of all sets.

(5) Less than or equal (<=) is a partial order defined on the set of real numbers.

(6) Less than or equal (<=) is a total order defined on the set of real numbers.

(7) Less than (<) is a partial order defined on the set of real numbers.

(8) Less than (<) is a total order defined on the set of real numbers.

4. (12) True or False.

 

(1) f (x) = 2x is onto where f: R -> R.           (Note: R is the set of real numbers)

(2) f (x) = 2x is one-to-one where f: R -> R.

(3) f(x) = x² is onto where f: R -> R.

(4) f(x) = x² is one-to-one where f: R -> R.

(5) f(x) = x² is onto where f: R -> [0, ?).

(6) f(x) = x² is one-to-one where f: R -> [0, ?).

5. (6) Let ? be the set of nonnegative integers. For each of the following sentences in first-order logic, state whether the sentence is valid, is satisfiable (but not valid), or is unsatisfiable.

(1) "x ÃŽ ? ($y ÃŽ ? (y < x)).

(2) "x ÃŽ ? ($y ÃŽ ? (y > x)).

(3) "x ÃŽ ? ($y ÃŽ ? f(x) = y).

6. (20) Are the following sets closed under the given operations? Answer yes or no. If the answer is no, please specify what the closure is.

(1) The negative integers under subtraction.

(2) The odd integers under the operation of mod 3.

(3) The positive integers under exponentiation.

         

(4) The finite sets under Cartesian product.

(5) The rational numbers under addition.

7. (20) True or False. If the answer is true, provide an example (Hint: use subsets of integers and real numbers) as a proof.

(1) The intersection of two countably infinite sets can be finite.

(2) The intersection of two countably infinite sets can be countably infinite.

(3) The intersection of two uncountable sets can be finite.

(4) The intersection of two uncountable sets can be countably infinite.

(5) The intersection of two uncountable sets can be uncountable.