Two properties we will need of the naturals: only 0 is not a successor, and every nonempty subset has a least element (Well-Ordering). Examples of non-well-ordered sets.
Weak induction. Strong induction.
Theorem about theorems: weak induction proofs are actually proofs. Proof: uses Well-Ordering.
Sample weak induction proof: If n>4, then 2n > n2.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment