An intuitionistic version of Zermelo's proof that every choice set can be well-ordered
From MaRDI portal
Publication:2758049
DOI10.2307/2695096zbMATH Open0988.03092OpenAlexW2046437992MaRDI QIDQ2758049
Publication date: 5 July 2002
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2695096
Categorical logic, topoi (03G30) Topoi (18B25) Nonclassical and second-order set theories (03E70) Intuitionistic mathematics (03F55) Axiom of choice and related propositions (03E25)
Cites Work
Related Items (2)
Takeuti's well-ordering proof: finitistically fine? โฎ The Mathematical Import of Zermelo's Well-Ordering Theorem
Recommendations
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Intuitionistically provable recursive well-orderings ๐ ๐
- LIFTING PROOF THEORY TO THE COUNTABLE ORDINALS: ZERMELO-FRAENKEL SET THEORY ๐ ๐
- The Axiom of Choice, Well-Ordering, and Well-Classification ๐ ๐
- AN AXIOMATIC THEORY OF WELL-ORDERINGS ๐ ๐
- The Axiom of Choice, Fixed Point Theorems, and Inductive Ordered Sets ๐ ๐
- The Mathematical Import of Zermelo's Well-Ordering Theorem ๐ ๐
- The axiom of choice for well-ordered families and for families of well-orderable sets ๐ ๐
This page was built for publication: An intuitionistic version of Zermelo's proof that every choice set can be well-ordered
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2758049)