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

被引:0
|
作者
Wilson, JT [1 ]
机构
[1] Calif State Univ Fresno, Dept Comp Sci, Fresno, CA 93740 USA
关键词
D O I
10.2307/2695096
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
下载
收藏
页码:1121 / 1126
页数:6
相关论文
共 50 条