Graduate studies at Western
Journal of Symbolic Logic 66 (3):1121-1126 (2001)
|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|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
David W. Miller (2007). Some Restricted Lindenbaum Theorems Equivalent to the Axiom of Choice. Logica Universalis 1 (1):183-199.
Neil Tennant (1994). Intuitionistic Mathematics Does Not Needex Falso Quodlibet. Topoi 13 (2):127-133.
Steve Awodey, Carsten Butz & Alex Simpson (2007). Relating First-Order Set Theories and Elementary Toposes. Bulletin of Symbolic Logic 13 (3):340-358.
Michael Rathjen (2005). The Disjunction and Related Properties for Constructive Zermelo-Fraenkel Set Theory. Journal of Symbolic Logic 70 (4):1233 - 1254.
David Pincus (1997). The Dense Linear Ordering Principle. Journal of Symbolic Logic 62 (2):438-456.
A. R. D. Mathias (2001). Slim Models of Zermelo Set Theory. Journal of Symbolic Logic 66 (2):487-496.
Gregory H. Moore (1978). The Origins of Zermelo's Axiomatization of Set Theory. Journal of Philosophical Logic 7 (1):307 - 329.
Added to index2009-01-28
Total downloads4 ( #189,403 of 738,370 )
Recent downloads (6 months)1 ( #61,778 of 738,370 )
How can I increase my downloads?