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)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Some Restricted Lindenbaum Theorems Equivalent to the Axiom of Choice.David W. Miller - 2007 - Logica Universalis 1 (1):183-199.
Intuitionistic Mathematics Does Not Needex Falso Quodlibet.Neil Tennant - 1994 - Topoi 13 (2):127-133.
Relating First-Order Set Theories and Elementary Toposes.Steve Awodey, Carsten Butz & Alex Simpson - 2007 - Bulletin of Symbolic Logic 13 (3):340-358.
The Disjunction and Related Properties for Constructive Zermelo-Fraenkel Set Theory.Michael Rathjen - 2005 - Journal of Symbolic Logic 70 (4):1233 - 1254.
What Does It Take to Prove Fermat's Last Theorem? Grothendieck and the Logic of Number Theory.Colin Mclarty - 2010 - Bulletin of Symbolic Logic 16 (3):359-377.
Slim Models of Zermelo Set Theory.A. R. D. Mathias - 2001 - Journal of Symbolic Logic 66 (2):487-496.
The Origins of Zermelo's Axiomatization of Set Theory.Gregory H. Moore - 1978 - Journal of Philosophical Logic 7 (1):307 - 329.
Added to index2009-01-28
Total downloads12 ( #374,747 of 2,164,541 )
Recent downloads (6 months)1 ( #347,971 of 2,164,541 )
How can I increase my downloads?