Math 2090.03 N Assignments 4& 5
due April 5th, 1999

INSTRUCTIONS: This assignment is due April 5th 1999, in class. Groups may hand in a single assignment paper. The maximum group size is 4.

The assignments must have the name and York number of all group members listed at the top of the paper.

Any axiom may be used. Lower numbered theorems may be used in the proof of a higher numbered theorem.


  1. Translate the following english sentences into quantified expressions in predicate logic. First construct suitable types, then a suitable 2-place predicate, and then write the quantified expressions.
    1. You can fool some of the people some of the time.
    2. You can fool all of the people some of the time.
    3. You can't fool all the people all the time.
    4. You can't fool a person all the time

  2. For every occurrence of an object variable in the following expression state whether it is free or bound
    displaymath32
  3. Let our domain be the set of non-negative integers (i.e. tex2html_wrap_inline34). Let + and tex2html_wrap_inline38 have their usual meaning of addition and multiplication. Let us also have the following predicates Prove that the following are true, false, or may be true in a certain state, and may be false in another. In the latter case if possible give a state for which it is true and a state for which it is false, otherwise justify why all states either give true or give false.
    1. tex2html_wrap_inline44.
    2. tex2html_wrap_inline46.
    3. tex2html_wrap_inline48.
    4. tex2html_wrap_inline50.
  4. Give a bullet proof that tex2html_wrap_inline52 (tex2html_wrap_inline54).
  5. Give a bullet proof that tex2html_wrap_inline56 (tex2html_wrap_inline58)

Stephanie van Willigenburg