CSC B36 additional notes

• what you should know about proofs.
• how NOT to write proofs.
• common ways to write statements in English.
• simple and complete induction.
• structure of induction proofs.
• sample induction and well-ordering proofs.
• pseudocode used for program correctness.
• proving program correctness.
• sample correctness proofs.
• an example where correctness is not obvious.
• structural induction for regular expressions.
• proving closure property using FSA method. This one is HTML, not PDF.
• proving languages NOT regular using Pumping Lemma.
• proving a set of connectives complete and NOT complete.
• summary of logical equivalences from the course notes.