An intuitionistic version of Zermelo's proof that every choice set can be well-ordered
AbstractWe give a proof, valid in any elementary topos, of the theorem of Zermelo that any set possessing a choice function for its set of inhabited subsets can be well-ordered. Our proof is considerably simpler than existing proofs in the literature and moreover can be seen as a direct generalization of Zermelo's own 1908 proof of his theorem.
2016 ◽
Vol 106
(8)
◽
pp. 2145-2184
◽
Keyword(s):
1999 ◽
Vol 14
(4)
◽
pp. 343-355
◽
1999 ◽
Vol 14
(4)
◽
pp. 271-281
◽
2020 ◽
Vol 0
(0)
◽