We have the following indirect implication of form equivalence classes:

409 \(\Rightarrow\) 120-K
given by the following sequence of implications, with a reference to its direct proof:

Implication Reference
409 \(\Rightarrow\) 62 Short proof of a theorem of Rado on graphs, Foster, B. L. 1964, Proc. Amer. Math. Soc.
note-152
62 \(\Rightarrow\) 61 clear
61 \(\Rightarrow\) 46-K clear
46-K \(\Rightarrow\) 120-K clear

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

Howard-Rubin Number Statement
409:

Suppose \((G,\Gamma)\) is a locally finite graph (i.e. \(G\) is a non-empty set and \(\Gamma\) is a function from \(G\) to \(\cal P(G)\) such that for each \(x\in G\), \(\Gamma(x)\) and \(\Gamma^{-1}\{x\}\) are finite), \(K\) is a finite set of integers, and \(T\) is a function mapping subsets of \(K\) into subsets of \(K\). If for each finite subgraph \((A,\Gamma_A)\) there is a function \(\psi\) such that for each \(x\in A\), \(\psi(x)\in T(\psi[\Gamma_A(x)])\), then there is a function \(\phi\) such that for all \(x\in G\), \(\phi(x)\in T(\phi[\Gamma(x)])\).

62:

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

61:

\((\forall n\in\omega, n\ge 2\))\((C(\infty,n))\): For each \(n\in\omega\), \(n\ge 2\), every set of \(n\) element  sets has a choice function.

46-K:

If \(K\) is a finite subset of \(\omega-\{0,1\}\), \(C(\infty,K)\): For every \(n\in K\), every set of \(n\)-element sets has a choice function.

120-K:

If \(K\subseteq\omega-\{0,1\}\), \(C(LO,K)\): Every linearly ordered set of non-empty sets each of whose cardinality is in \(K\) has a choice function.

Comment:

Back