CS 486 Applied Logic Assignment #11
Spring 1997 Due Date: Thurs., 4/24/97

1. 1. Apply Cantor's diagonal argument to prove that is not enumerated by . Give the explicit diagonal construction for some alleged enumeration.
   2. Use Cantor's diagonal argument to prove that there is no computable function to enumerate all computable functions from to . Relate this argument to my explanation of the Skolem paradox.
2. Define in set theory the set of formulas that I axiomatized in the prelim. Also define the boolean evaluation function. Arrange that your definitions will satisfy the axioms in the prelim.

• About this document ...