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

Journal of Symbolic Logic 66 (3):1121-1126 (2001)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2695096
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,169
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index

Total downloads
12 ( #385,717 of 2,191,856 )

Recent downloads (6 months)
1 ( #288,547 of 2,191,856 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature