We have the following indirect implication of form equivalence classes:
Implication | Reference |
---|---|
333 \(\Rightarrow\) 67 | clear |
67 \(\Rightarrow\) 76 | clear |
76 \(\Rightarrow\) 131 | clear |
Here are the links and statements of the form equivalence classes referenced above:
Howard-Rubin Number | Statement |
---|---|
333: | \(MC(\infty,\infty,\mathrm{odd})\): For every set \(X\) of sets such that for all \(x\in X\), \(|x|\ge 1\), there is a function \(f\) such that for every \(x\in X\), \(f(x)\) is a finite, non-empty subset of \(x\) and \(|f(x)|\) is odd. |
67: | \(MC(\infty,\infty)\) \((MC)\), The Axiom of Multiple Choice: For every set \(M\) of non-empty sets there is a function \(f\) such that \((\forall x\in M)(\emptyset\neq f(x)\subseteq x\) and \(f(x)\) is finite). |
76: | \(MC_\omega(\infty,\infty)\) (\(\omega\)-MC): For every family \(X\) of pairwise disjoint non-empty sets, there is a function \(f\) such that for each \(x\in X\), f(x) is a non-empty countable subset of \(x\). |
131: | \(MC_\omega(\aleph_0,\infty)\): For every denumerable family \(X\) of pairwise disjoint non-empty sets, there is a function \(f\) such that for each \(x\in X\), f(x) is a non-empty countable subset of \(x\). |
Comment: