We have the following indirect implication of form equivalence classes:

359 \(\Rightarrow\) 170
given by the following sequence of implications, with a reference to its direct proof:

Implication Reference
359 \(\Rightarrow\) 20 clear
20 \(\Rightarrow\) 101 Partition principles and infinite sums of cardinal numbers, Higasikawa, M. 1995, Notre Dame J. Formal Logic
101 \(\Rightarrow\) 40 On some weak forms of the axiom of choice in set theory, Pelc, A. 1978, Bull. Acad. Polon. Sci. S'er. Sci. Math. Astronom. Phys.
40 \(\Rightarrow\) 337 clear
337 \(\Rightarrow\) 92 clear
92 \(\Rightarrow\) 170 Non-constructive properties of the real numbers, Howard, P. 2001, Math. Logic Quart.

Here are the links and statements of the form equivalence classes referenced above:

Howard-Rubin Number Statement
359:

If \(\{A_{x}: x\in S\}\) and \(\{B_{x}: x\in S\}\) are families  of pairwise disjoint sets and \( |A_{x}| \le |B_{x}|\) for all \(x\in S\), then \(|\bigcup_{x\in S}A_{x}| \le |\bigcup_{x\in S} B_{x}|\).

20:

If \(\{A_{x}: x \in S \}\) and \(\{B_{x}: x \in  S\}\) are families  of pairwise disjoint sets and \( |A_{x}| = |B_{x}|\) for all \(x\in S\), then \(|\bigcup_{x\in S}A_{x}| = |\bigcup_{x\in S} B_{x}|\). Moore [1982] (1.4.12 and 1.7.8).

101:

Partition Principle:  If \(S\) is a partition of \(M\), then \(S \precsim M\).

40:

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

337:

\(C(WO\), uniformly linearly ordered):  If \(X\) is a well ordered collection of non-empty sets and there is a function \(f\) defined on \(X\) such that for every \(x\in X\), \(f(x)\) is a linear ordering of \(x\), then there is a choice function for \(X\).

92:

\(C(WO,{\Bbb R})\):  Every well ordered family of non-empty subsets of \({\Bbb R}\) has a choice function.

170:

\(\aleph_{1}\le 2^{\aleph_{0}}\).

Comment:

Back