Journal of Symbolic Logic

An Intuitionistic Version of Zermelo's Proof That Every Choice Set Can Be Well-Ordered

J. Todd Wilson

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

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.

Article information

Source
J. Symbolic Logic, Volume 66, Issue 3 (2001), 1121-1126.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183746549

Mathematical Reviews number (MathSciNet)
MR1856731

Zentralblatt MATH identifier
0988.03092

JSTOR
links.jstor.org

Citation

Wilson, J. Todd. An Intuitionistic Version of Zermelo's Proof That Every Choice Set Can Be Well-Ordered. J. Symbolic Logic 66 (2001), no. 3, 1121--1126. https://projecteuclid.org/euclid.jsl/1183746549


Export citation