SP19:Lecture 5 Quantifiers and negation

From CS2800 wiki
Revision as of 14:10, 1 February 2019 by {{GENDER:Mdg39|[math]'"2}} [/math]'"7
(<math>1) </math>2 | <math>3 (</math>4) | <math>5 (</math>6)

This is a placeholder for the lecture 5 notes, which are under construction.

See the summary slides and board image

Key takeaways:

  • We completed the table of proof techniques
  • We discussed proof by contradiction
  • We discussed nested quantifiers
    • everybody loves somebody vs. there's somebody that everybody loves
    • limits example: we can encode complicated ideas like "this function can get arbitrarily close to a given output by choosing a sufficiently close input" using nested quantified statements. Repeatedly applying standard proof techniques will get you through.