1) From the last chapter titled “Recurrence relations; and their closed-form solutions” — Safe Sets. Notes #11— only sections 6.1 and 6.2 are examinable. The rest is not examinable (that is, 6.3 and 6.4 are not examinable).

2) All else from our lecture notes — from Russell’s Paradox, and "Safe Sets",  Notes #1 - #11—  is examinable, but recall exceptions that are already noted:

    •    On the topic of Induction — Safe Sets. Notes #8— you do not need to know the proofs of the equivalence between MC, CVI and SI. Just practice induction proofs, studying the examples solved in the notes and attempting the questions (Exercises) proposed for practice in the notes.
    •    The topic of Inductive definition of FUNCTIONS  — Safe Sets. Notes #9— will not be examinable.

    3)    The topic of Inductive definition of SETS is ON  — Safe Sets. Notes #10  It IS examinable. You must know the technique of Induction over an inductively defined set ("Cl(I, O)") You are already working on a related exercise in Assignment #4.

    ✓    You will receive the PDF from the usual course web page.

    ✓    Download or view the PDF on line. Prepare answers exactly as you did to date for your assignments. Pencil and paper.

    ✓    Then scan or photograph and upload to Moodle  in the Area labelled "FINAL EXAM".   Only PDF, PNG, ZIP, and MS Word  formats are accepted.  ONE FILE ONLY can be uploaded.

    ✓    Uploading is enabled from 9:00am to 11:45 am. The official exam duration is 9:00 - 11:00 am, but you have an extra 45 minutes until 11:45 am just in case you encounter upload glitches. Uploading will NOT be possible after 11:45am.

• (Mar. 18, 2020) There is  Moodle access to the course for Q & A and submission of Assig #4 and Final Exam electronically. Final Exam is on line, on April 9, 2020, 2 hours, starting at 9:00 am.
  
• (Mar. 15, 2020) A new heading "Comments on  lecture notes" has been added with hints on what to pay attention to.
  
• (Mar. 13, 2020) Course-specific Plan to complete the Term in the absence of face-to-face contact.  (1) Our lecture notes that have been regularly posted are a faithful image of the lectures. Imperfectly, but inevitably, they will be the substitute of the lectures. Please visit this site frequently. There will be at least three more lecture-notes "sections" or "chapters" uploaded.  (2) Office hours and Tutorials entail face-2-face contact and are disallowed by York. Thus we will hold Office Hours by email. Questions sent by students to me in the 1:00pm-2:00 time-window on Thursdays AND Tuesdays, until our Final Exam Date (April 9), will be answered promptly.  (3) Tutorials will be also conducted by email. Please send emails to the TAs in the windows provided by the tutorial group that you are enrolled in. See below for the email addresses!  Final Exam. There is no word about cancellation of Final Exams to date, but you never know. Thus I am orienting my thinking toward an at-home time-limited exam regardless. I will get details to you promptly on this page  once the logistics are in place. 
  
• (Mar. 13, 2020) The Midterm is ON as scheduled!!
  
• (Mar. 12, 2020) The Unofficial Problem Set #3 grades are here. View/Download.
  
• (Mar. 8, 2020) IMPORATNT INFO FOR MIDTERM: Because of the class size we are writing in three (3) different rooms in ACW (same date/time: March 13, at 1:30pm) : Students whose names start with A to Q inclusive write in ACW 206; Students whose names start with R to S inclusive write in ACW 205; Students whose names start with T to Z inclusive write in ACW 305
  
• (Mar. 2, 2020) Deadline for Assig #3 is now extended: Due on Friday Mar. 6 at 1:00 pm (please note time!)
  
• (Feb. 29, 2020) The Unofficial Problem Set #2 grades are here. View/Download.
  
• (Feb. 12, 2020) Please Note: (1) The due time of the Assignment #2 today: It is 3:00 pm. (2) There are no tutorials during the Reading Week.
  
• (Feb. 11, 2020) Please get your Assignment papers from the Tutorial you are registered in. There is no other way to get the papers back.
  
• (Feb. 8, 2020) The Unofficial Problem Set #1 grades are here. View/Download.
  
• (Jan. 31, 2020) Here is the PASS moodle page link. The enrollment key will be given in class. 
  
• (Jan. 28, 2020) Regrettably I cannot hold the Office Hour on Thursday Jan. 30, 2020.
  
• (Jan. 14, 2020) The course drop box is located in Lassonde Building, First Floor, in the "balcony" area above the the Atrium. The box is placed against the outer wall of the 1012 Wing of the Main Office Area.  The box has a slot (top right) labelled for EECS 1028.
  

• For now and until my next posted comment appears, study Notes #8 and do all "exercises" there. Ask me (or the TAs) when needed. Please skim over the "theory part" (i.e., the part MC=CV=SI; know this result, but NOT the proofs) and concentrate to understanding the several examples of Induction (ask me or the TAs when needed).
• BTW, remember that when you do an induction proof, the I.H., whether it is just "P[n]" (for SI) or "for all k<n, P[n]" (for CVI), the n is fixed! The I.H. is for a fixed n, not for all n.
• In Notes #9 you should study the statements of the main theorems. You may omit the proofs with no detriment to continuity. Concentrate on the examples.
• In Notes #10 you should study the statements of the main theorems. Please aim for a good understanding on why the proof of induction over the defined set works and study the examples. Two of them are closely related to a problem in Assignment #4.
  
• Remarks on yesterday's (March 18, 2020) Moodle practice (83 students participated). Download/view.
• NEW (Mar. 20, 2020) In problem #8 of Assignment 4 there is a Hint. Add to it the observation that in the second induction -- with respect to string length n -- you have as Basis n=0, but also have boundary "basis-like" cases for n=1, since the I.H. does not apply to those. So verify claim directly for cases n=0, AND n=1.
• NEWER (Mar. 22, 2020) Reminder: What can go wrong with induction? I will list three things that are as wrong as it gets. Please avoid them! (1) Never say, "verified P(n), for n=1, 2, 3, .., 10, and so on (without doing the "so on") therefore P(n) is true for all n". (2) Never skip the I.H.! (3) Absolutely never say: "I.H. is: assume P(n) for all n" No, no and no! You must assume P(n) for a FIXED unspecified n (i.e., not n=3 or 42). But certainly NOT "for all n". After all, this is what you are trying to PROVE.
  

Moodle related practice