The Well-Ordering Principles of the Natural Numbers
Channel: Andrew Misseldine
Date: 2020-09-09

In this video, we discuss the Well-Ordering Principle of the Natural Numbers and discuss its equivalence to the Induction Axiom. We provide an example of proof by smallest counterexample and compare the similarity to an induction proof.

This is lecture 5 (part 4/4) of the lecture series offered by Dr. Andrew Misseldine for the course Math 4220 - Abstract Algebra I at Southern Utah University. A transcript of this lecture can be found at Dr. Misseldine's website or through his Google Drive at: https://drive.google.com/file/d/1dywJUe2FLOijUUdJOFDO0DPpM8N2sUc9/view

This lecture is based upon Section 2.1 of Abstract Algebra: Theory and Applications (http://abstract.ups.edu/) by Tom Judson. Please post any questions you might have below in the comment field and Dr. Misseldine (or other commenters) can answer them for you. Please also subscribe for further updates.