If You Use a Screen Reader
This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Journal Article
An Intuitionistic Version of Zermelo's Proof That Every Choice Set Can Be Well-Ordered
J. Todd Wilson
The Journal of Symbolic Logic
Vol. 66, No. 3 (Sep., 2001), pp. 1121-1126
Published
by: Association for Symbolic Logic
DOI: 10.2307/2695096
https://www.jstor.org/stable/2695096
Page Count: 6
You can always find the topics here!
Topics: Mathematical topoi, Logical theorems, Mathematical functions, Induction assumption, Mathematical relations
Were these topics helpful?
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
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.
The Journal of Symbolic Logic
© 2001 Association for Symbolic Logic