BU CLA MA 531: Computability and Logic

Fall 1995

Problem Set 8 (due Friday 95.11.03)

1. Exercise 1, p 193.
   Hint: Solved in class.

2. Exercise 4, p 193. Show elimination of quantifiers for wff's with 0 (trivial), 1 (less trivial), 2 (less trivial still), and 3 free variables (interesting). Do not bother about wff's with arbitrarily many free variables.
   Hint: Use Theorem 31F, and refresh your knowledge about dense linear orderings, page 149.

Assaf Kfoury

Created: 95.10.27