With the Zermelo–Fraenkel axioms above, this makes up the system ZFC in which most mathematics is potentially formalisable. Equivalents of AC Hausdorff maximality theorem Well-ordering principle Zorn's lemma Stronger than AC Axiom of global choice Weaker than AC Axiom of countable choice Axiom of dependent choice Boolean prime ideal theorem Axiom of uniformization Alternates incompatible with AC Axiom of real determinacy See also Zermelo set theory. |
About us|Jobs|Help|Disclaimer|Advertising services|Contact us|Sign in|Website map|Search|
GMT+8, 2015-9-11 22:04 , Processed in 0.132167 second(s), 16 queries .