We have the following indirect implication of form equivalence classes:

325 \(\Rightarrow\) 288-n
given by the following sequence of implications, with a reference to its direct proof:

Implication Reference
325 \(\Rightarrow\) 17 clear
17 \(\Rightarrow\) 132 Amorphe Potenzen kompakter Raume, Brunner, N. 1984b, Arch. Math. Logik Grundlagenforschung
132 \(\Rightarrow\) 10 Amorphe Potenzen kompakter Raume, Brunner, N. 1984b, Arch. Math. Logik Grundlagenforschung
10 \(\Rightarrow\) 288-n clear

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

Howard-Rubin Number Statement
325:

Ramsey's Theorem II: \(\forall n,m\in\omega\), if A is an infinite set and the family of all \(m\) element subsets of \(A\) is partitioned into \(n\) sets \(S_{j}, 1\le j\le n\), then there is an infinite subset \(B\subseteq A\) such that all \(m\) element subsets of \(B\) belong to the same \(S_{j}\). (Also, see Form 17.)

17:

Ramsey's Theorem I: If \(A\) is an infinite set and the family of all 2 element subsets of \(A\) is partitioned into 2 sets \(X\) and \(Y\), then there is an infinite subset \(B\subseteq A\) such that all 2 element subsets of \(B\) belong to \(X\) or all 2 element subsets of \(B\) belong to \(Y\). (Also, see Form 325.), Jech [1973b], p 164 prob 11.20.

132:

\(PC(\infty, <\aleph_0,\infty)\):  Every infinite family of finite  sets has an infinite subfamily with a choice function.

10:

\(C(\aleph_{0},< \aleph_{0})\):  Every denumerable family of non-empty finite sets has a choice function.

288-n:

If \(n\in\omega-\{0,1\}\), \(C(\aleph_0,n)\): Every denumerable set of \(n\)-element sets has a choice function.

Comment:

Back