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

1. Define the concept of a finite sequence in set theory. Compare it to the definition of a list in . Show they are equivalent in some sense.
2. Recall that in class we gave a ``computational account'' of natural number equality, say in and of the commutative law . Give a set based account and then compare the ``educational philosophy'' suggested by each approach.
3. Show that there is an algorithm to decide equality of two natural numbers in PA (or in ) but that it is impossible in ZF (or if you have not had CS481 then show it is highly unlikely).
4. Suppes, page 149, problems 9, 10, 11.

• About this document ...