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

Journal of Symbolic Logic 66 (3):1121-1126 (2001)
  Copy   BIBTEX

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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,270

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
62 (#344,971)

6 months
9 (#500,261)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jessica M. Wilson
University of Toronto at Scarborough

Citations of this work

No citations found.

Add more citations

References found in this work

Choice and well-ordering.Peter Freyd - 1987 - Annals of Pure and Applied Logic 35 (C):149-166.

Add more references