⚛️Igor Kan

Home

❯

Digital Garden (proof of concept)

❯

Well Ordering Theorem

Well-Ordering Theorem

  • Every set can be well-ordered.
  • Equivalent to axiom of choice.

∀A∃R⊆A×Aa well-ordering on A


Graph View


  • Email
  • GitHub
  • X (Twitter)

Created with Quartz v4.5.1 © 2025