An Intuitionistic Version of Zermelo's Proof That Every Choice Set Can Be Well-Ordered
Wilson, J. Todd
J. Symbolic Logic, Tome 66 (2001) no. 1, p. 1121-1126 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We 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.
Publié le : 2001-09-14
Classification:  
@article{1183746549,
     author = {Wilson, J. Todd},
     title = {An Intuitionistic Version of Zermelo's Proof That Every Choice Set Can Be Well-Ordered},
     journal = {J. Symbolic Logic},
     volume = {66},
     number = {1},
     year = {2001},
     pages = { 1121-1126},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183746549}
}

Wilson, J. Todd. An Intuitionistic Version of Zermelo's Proof That Every Choice Set Can Be Well-Ordered. J. Symbolic Logic, Tome 66 (2001) no. 1, pp.  1121-1126. http://gdmltest.u-ga.fr/item/1183746549/