CS 281 Final Exam


August 8, 1996

1. Using the predicate symbols given below, transcribe each of the following English sentences into a proposition of a predicate logic. The universe is the whole world.

B(x): x is a bee.
F(x): x is a flower.
K(x): x is a beekeeper.
L(x,y): x loves y.

(a) Not everything is a bee.
(b) Some bees love all flowers.
(c) Every bee loves only flowers.
(d) Every beekeeper loves bees which love flowers.
(e) No beekeeper loves bees if they don't love flowers.

2 (a) Find the power set of { tex2html_wrap_inline52 , { tex2html_wrap_inline52 }, 1}.
(b) Prove that tex2html_wrap_inline58 .
Hint: Use proof by contradiction.

3. Prove by induction that tex2html_wrap_inline60 for all natural number n.

4 (a) Find the transitive closure of the binary relation { tex2html_wrap_inline64 }.
You may use a digraph to represent your answer, if you prefer that.
(b) Determine for each relation given below whether it is reflexive, irreflexive, symmetric, antisymmetric and/or transitive. Also which ones are a partial order and which ones are an equivalence relation ?
(1) For any subsets A and B of a set S, tex2html_wrap_inline72 iff tex2html_wrap_inline74 .
(2) For any integers x and y, tex2html_wrap_inline80 iff tex2html_wrap_inline82 (mod 5).
(3) For any numbers x and y, tex2html_wrap_inline80 iff tex2html_wrap_inline92 .

5 (a) Define the set of non-negative integer multiples of 5 inductively.
(b) Prove by induction that any arbitrary non-negative integer multiple of 5 ends in 0 or 5, that is its least significant digit is 0 or 5.




S. Toida
Thu May 29 10:53:17 EDT 1997