BPI: Every Boolean algebra has a prime ideal.

\(C(\aleph_{0},\le 2^{\aleph_{0}})\):  Every denumerable collection of non-empty sets  each with power \(\le  2^{\aleph_{0}}\) has a choice function.

\((\forall \alpha)(UT(\aleph_{\alpha},\aleph_{\alpha}, \aleph_{\alpha}))\): For every ordinal \(\alpha\), if \(A\) and every member of \(A\) has cardinality \(\aleph_{\alpha}\), then \(|\bigcup A| = \aleph _{\alpha }\).

\(C(\aleph_0,2^{(2^{\aleph_0})})\): Every denumerable collection of non-empty sets each with power \(2^{(2^{\aleph_{0}})}\) has a choice function.

Lebesgue measure is countably additive.

\(C(\infty,WO)\): Every set of non-empty, well orderable sets has a choice function.
Moore, G. [1982], p 125.

\(PW\):  The power set of a well ordered set can be well ordered.

\({\cal P}(\Bbb R)\) is well orderable.

\(C(WO,WO)\):  Every well ordered family of non-empty, well orderable sets has a choice function.

\(SVC\): There is a set \(S\) such that for every set \(a\), there is an ordinal \(\alpha\) and a function from \(S\times\alpha\) onto \(a\).

There is a subset of \({\Bbb R}\) which is not Borel.

There are \(2^{\aleph_0}\) Vitali equivalence classes. (Vitali equivalence classes are equivalence classes of the real numbers under the relation \(x\equiv y\leftrightarrow(\exists q\in{\Bbb Q})(x-y=q)\).). \ac{Kanovei} \cite{1991}.

Weak Sikorski Theorem:  If \(B\) is a complete, well orderable Boolean algebra and \(f\) is a homomorphism of the Boolean algebra \(A'\) into \(B\) where \(A'\) is a subalgebra of the Boolean algebra \(A\), then \(f\) can be extended to a homomorphism of \(A\) into \(B\).

In \(\Bbb R\), the union of a denumerable number of analytic sets is analytic. G. Moore [1982], pp 181 and 325.

There are exactly \(2^{\aleph_0}\) Borel sets in \(\Bbb R\). G. Moore [1982], p 325.

The set of all denumerable subsets of \(\Bbb R\) has power \(2^{\aleph_0}\).

If \(\Bbb R\) is partitioned into two sets, at least one of them has cardinality \(2^{\aleph_0}\).

\(KW(\infty,\infty)\) (KW), The Kinna-Wagner Selection Principle: For every  set \(M\) there is a function \(f\) such that for all \(A\in M\), if \(|A|>1\) then \(\emptyset\neq f(A)\subsetneq A\). (See Form 81(\(n\)).  

\(C(WO,\infty)\):  Every well orderable set of non-empty sets has a choice function. Moore, G. [1982], p 325.

Cofinality Principle: Every linear ordering has a cofinal sub well ordering.  Sierpi\'nski [1918], p 117.

If \((A,\le)\) is a partial ordering that is not a well ordering, then there is no set \(B\) such that \((B,\le)\) (the usual injective cardinal ordering on \(B\)) is isomorphic to \((A,\le)\).
Mathias [1979], p 120.

Every linearly orderable topological space is normal.  Birkhoff [1967], p 241.

Every set is almost well orderable.

\(D_{\aleph_{0}}\): Every non-well-orderable set is the union of a pairwise disjoint, well orderable family of denumerable sets.  (See note 27 for \(D_{\kappa}\), \(\kappa\) a well ordered cardinal.)

\(EP\) sets: For every set \(A\) there is a projective set \(X\) and a function from \(X\) onto \(A\).

\L o\'s' Theorem: If \(M=\langle A,R_j\rangle_{j\in J}\) is a relational system, \(X\) any set and \({\cal F}\) an ultrafilter in \({\cal P}(X)\), then \(M\) and \(M^{X}/{\cal F}\) are elementarily equivalent.

\(MC(WO,\infty)\): For  every well ordered set \(X\) such that for all \(x\in X\), \(|x|\ge 1\), there is a function \(f\) such that and for every \(x\in X\), \(f(x)\) is a finite, non-empty subset of \(x\). (See Form 67.)