This page must be submitted as the first page

of your exam-paper answer pages.

York University
Department of Electrical Engineering and Computer Science
Lassonde School of Engineering
EECS1028M FINAL EXAM, April 27, 2022; 2:00–4:00PM
Professor George Tourlakis
By putting my name and student ID on this Exam page, I attest to the fact that my answers
included here and submitted by Moodle are my own work, and that I have acted with integrity,
abiding by the Senate Policy on Academic Honesty that the instructor discussed at the beginning
of the course and linked the full Policy to the Course Outline.

Student NAME (Clearly):

Student NUMBER (Clearly):

DATE (Cearly):

README FIRST! INSTRUCTIONS:

1. Please read ALL these instructions
carefully before you start writing.
2. TIME-LIMITED ON LINE EXAM. You have
TWO (2) hours to answer the Exam questions,
plus another 15 minutes to allow a proper up-
loading job. Overall Exam End and last op-
portunity to upload is thus at 4:15 PM. Only Question MAX POINTS MARK
ONE file can be uploaded per student. 1 4
2 9
3. If you submit photographed copy it still must be just 3 4
ONE file that you submit. Either ZIP the im- 4 4
ages OR import them in MS Word and submit ONE 5 4
Word file with the images attached. 6 4
7 4
4. Using the time allotted for the uploading mechanisms
8 6
(15 min) for the exam-answering part is at your own
discretion. But also at your own risk. Exam not TOTAL 39
uploaded = Exam not written.
5. Please write your answers by hand as you nor-
mally do for assignments or use a word
processor that can convert to PDF. Microsoft
Word is acceptable to upload as is (without
conversion to PDF).
6. NO submission will be accepted if it is by email OR > 10MB in size.
EECS 1028 M FINAL EXAM April 2022

Question 1. (a) (1 MARK) What does Principle 2 state?

(b) (1 MARK) Define “labelling” of the members of a class A —where the legal labels are
the members of a set L.
(c) (2 MARK) State Principle 3.

2
EECS 1028 M FINAL EXAM April 2022

Question 2. (a) (2 MARKS ) Let < be an arbitrary order.

Translate in MATHEMATICAL language the quoted statement: “< has MC”.

(b) (2 MARKS ) Does the usual < on the integers Z = {. . . , 2, 1, 0, 1, 2, . . .} have MC?

Justify your answer.

(c) (5 MARKS) Now suppose that some < —which is NOT THE USUAL ONE on N—
indeed has MC.

Prove that there is NO infinite (enumerable) sequence of objects ai —these are NOT
NECESSARILY NUMBERS— for which the “infinite descending (by size) chain” below
represents a true statement about the ai :

. . . < ai+1 < ai < . . . < a2 < a1 < a0 (1)

Hint. If we do have the truth of (1) for some “well-chosen” ai , then consider the set

{. . . , ai+1 , ai , . . . , a2 , a1 , a0 } (2)

and take it from here.

WHY is (2) a “SET”?

3
EECS 1028 M FINAL EXAM April 2022

Question 3. (4 MARKS) Prove using the short north-east diagonals

or any other mathematical method of your preference, that if A is an enumerable set, then it
is also countable with an enumeration that lists each of its members exactly four (4) times.
Hint. Your proof must consist of constructing an enumeration with the stated repetitions-
requirement.

4
EECS 1028 M FINAL EXAM April 2022

Question 4. (4 MARKS) Prove A ⌘ B ` (8x)A ⌘ (8x)B without using the equivalence theorem.

Rather use 6.2.19 in your proof, remembering the ping-pong tautology (6.2.10). (Reference
numbers refer to our “dynamic Notes”).

5
EECS 1028 M FINAL EXAM April 2022

Question 5. (4 MARKS) By choosing a specific “A(x)” over the natural numbers show that the claim in
quotes

“(9x)A(x) ! A(x) is a theorem”

is in general FALSE.

6
EECS 1028 M FINAL EXAM April 2022

Question 6. (4 MARKS) Use Induction to prove that 22n+1 + 32n+1 is divisible by 5 for all n 0.

7
EECS 1028 M FINAL EXAM April 2022

 2
3 3 3 n(n + 1)
Question 7. (4 MARKS) Using induction prove that 1 + 2 + . . . + n = , for n 1.
2

8
EECS 1028 M FINAL EXAM April 2022

Question 8. Consider the closure Cl(I, O) where I = {2} and O contains just two operations on integers:
input vars output var
z }| { z}|{
x+y = z

and
input vars output var
z }| { z}|{
x y = z
Prove that Cl(I, O) = {2n : n 0 _ n < 0}.

Do so as required below:

(a) (3 MARKS) For Cl(I, O) ✓ {2n : n 0 _ n < 0} do induction over the closure.

(b) (3 MARKS) For Cl(I, O) ◆ {2n : n 0 _ n < 0} produce a derivation for the arbitrary
2n 2 {2n : n 0 _ n < 0}.