Zermelo-Frankel Set Theory and Well Orderings

In the first semester of 2006, I completed an investigation into the Zermelo-Frankel-Choice Axioms of Set Theory, and wrote an essay as part of my honours degree at Monash University. This document is the result of the investigation of the machinary neccessary to prove the celebrated Well Ordering Theorem: Every set can be well ordered. It highlights some of the history and the profound precision which has established modern mathematics.

You can access it here: zfw.pdf

Back | Home