⚛️Igor Kan

Home

❯

Archive

❯

Digital Garden (proof of concept)

❯

Well Ordering Theorem

Well-Ordering Theorem

Apr 16, 20261 min read

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

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


Graph View

Recent Notes

  • Yt title thumb tester

    Apr 16, 2026

    • 🚀 Skills

      Apr 16, 2026

      • Hi, I'm Igor Zakhidov.

        Apr 16, 2026

        • Social bio formatter

          Apr 16, 2026

          See 318 more →


          • Email
          • GitHub
          • X (Twitter)

          Created with Quartz v4.5.1 © 2026