challenge: In which framework is the well-ordering principle of the set of natural numbers considered a provable theorem?
  
  A. Euclidean geometry
  B. Zermelo-Fraenkel set theory
  C. Peano axioms
  D. Boolean algebra
  Answer: 