An intuitionistic version of Zermelo's proof that every choice set can be well-ordered

Authors
Citation
Jt. Wilson, An intuitionistic version of Zermelo's proof that every choice set can be well-ordered, J SYMB LOG, 66(3), 2001, pp. 1121-1126
Citations number
9
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF SYMBOLIC LOGIC
ISSN journal
00224812 → ACNP
Volume
66
Issue
3
Year of publication
2001
Pages
1121 - 1126
Database
ISI
SICI code
0022-4812(200109)66:3<1121:AIVOZP>2.0.ZU;2-G
Abstract
We give a proof, valid in any elementary topos, of the theorem of Zermelo t hat any set possessing a choice function for its set of inhabited subsets c an be well-ordered. Our proof is considerably simpler than existing proofs in the literature and moreover can be seen as a direct generalization of Ze rmelo's own 1908 proof of his theorem.